Problem
Research questions and friction points this paper is trying to address.
fairness
incomplete round robin tournament
draw
pots
team scheduling
Finding Fair Draws for Incomplete Round Robin Tournaments
🤖 AI Summary
This study addresses fairness issues in incomplete round-robin tournaments arising from real-world constraints such as team strength disparities, intra-association avoidance, and connectivity requirements. It presents the first systematic investigation into the existence and computational complexity of fair schedules under multiple constraints. By integrating computational complexity theory with constraint satisfaction techniques, the work establishes the NP-hardness of determining fair schedules in several canonical scenarios and introduces efficient constructive algorithms. Experimental validation demonstrates that the proposed approach effectively generates fair incomplete round-robin schedules satisfying diverse practical constraints, offering both theoretical foundations and practical tools for tournament organizers.
📝 Abstract
In an incomplete round robin tournament, teams play against different sets of opponents. Given varying strengths of the teams, this raises a fairness issue. We establish the complexity of determining whether a fair draw exists under various scenarios involving the presence of pots (i.e., strength based groups of teams), teams coming from the same association, connectivity requirements, and others. We also show experimentally how fair incomplete round robin tournaments can be generated.
Innovation
Methods, ideas, or system contributions that make the work stand out.
fair draw
incomplete round robin tournament
computational complexity
sports scheduling
fairness constraints
🔎 Similar Papers
No similar papers found.
