Sports scheduling for not all pairs of teams
Kenji Kashiwabara

TL;DR
This paper investigates a sports scheduling problem involving 2n teams, focusing on conditions for feasible schedules with specific home-away constraints, and explores the conjecture relating linear and integral solutions using perfect matchings.
Contribution
It reformulates Briskorn's conjecture using perfect matchings and monoids, and provides counterexamples and conditions for the conjecture's validity in regular graphs.
Findings
Counterexample of a regular graph with a linear solution but no integral solution
Reformulation of the scheduling problem using perfect matchings and monoids
Discussion of conditions under which the conjecture holds
Abstract
We consider the following sports scheduling problem. Consider teams in a sport league. Each pair of teams must play exactly one match in days. That is, games are held simultaneously in a day. We want to make a schedule which has games for days. When we make a schedule, the schedule must satisfy a constraint according to the HAP table, which designates a home game or an away game for each team and each date. Two teams cannot play against each other unless one team is assigned to a home game and the other team is assigned to an away game. Recently, D. Briskorn proposed a necessary condition for a HAP table to have a proper schedule. And he proposed a conjecture that such a condition is also sufficient. That is, if a solution to the linear inequalities exists, they must have an integral solution. In this paper, we rewrite his conjecture by using perfect…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Educational Games and Gamification
