Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/147667 
Autor:innen: 
Erscheinungsjahr: 
2006
Schriftenreihe/Nr.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 611
Verlag: 
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
Zusammenfassung: 
A single round robin tournament (RRT) consists of a set T of n teams (n even) and a set P of n - 1 periods. The teams have to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period. In order to establish fairness among teams we consider a partition of teams into strength groups. Then, the goal is to avoid a team playing against extremely weak or extremely strong teams in consecutive periods. We propose two concepts ensuring different degrees of fairness. One question arising here is whether a single RRT exists for a given number of teams n and a given partition of the set of teams into strength groups or not. In this paper we examine this question. Furthermore, we analyse the computational complexity of cost minimization problems in the presense of strength group requirements.
Schlagwörter: 
Round robin tournaments
fairness
partition of teams
strength groups
Dokumentart: 
Working Paper
Dokumentversion: 
Digitized Version

Datei(en):
Datei
Größe
817.93 kB





Publikationen in EconStor sind urheberrechtlich geschützt.