Combinatorial properties of strength groups in round robin tournaments
AbstractA 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 presence of strength group requirements.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 192 (2009)
Issue (Month): 3 (February)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Round robin tournaments Fairness Partition of teams Strength groups;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.