抄録
This paper considers fair home-away tables in sports scheduling. A home-away table defines where each match is held in a round-robin tournament, and the quality of the tournament schedule strongly depends on the home-away table. Although some home-away tables considering fairness have been proposed, some unfair aspects remain in them. We propose three kinds of home-away tables, an even-breaks table, a consecutive-breaks table, and a k-interval table, which are fairer than the previously proposed home-away tables. To find consecutive-breaks and k-interval home-away tables consistent with a given timetable, we propose algorithms based on 2-satisfiability. We also introduce a necessary condition on the number of teams where consecutive-breaks and k-interval home-away tables exist.
