Papers › Fair Schedules for Single Round Robin Tournaments with Ranked Participants
Fair Schedules for Single Round Robin Tournaments with Ranked Participants
Sten Wessel, Cor Hurkens, Frits Spieksma
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce a new measure to capture fairness of a schedule in a single round robin (SRR) tournament when participants are ranked by strength. To prevent distortion of the outcome of an SRR tournament as well as to guarantee equal treatment, we argue that each participant should face its opponents when ranked by strength in an alternating fashion with respect to the home/away advantage. Here, the home/away advantage captures a variety of situations. We provide an explicit construction proving that so-called ranking-fair schedules exist when the number of participants is a multiple of 4. Further, we give a formulation that outputs ranking-fair schedules when they exist. Finally, we show that the most popular method to come to a schedule for an SRR tournament, does not allow ranking-fair schedules when the number of teams exceeds 8. These findings impact the type of schedules to be used for SRR tournaments.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections