Paper Info
Title
The Stable Tournament Problem: Matching sports schedules with preferences.
Abstract
By combining sports scheduling with stable matching literature, this article defines the Stable Tournament Problem, which attempts to find a schedule of games that is stable with respect to teams’ preferences. In every round of a stable schedule, no pair of teams who have not played against each other has to play against less preferable opponents. An integer linear model is formulated and results are provided for instances with random preferences and preferences structured according to the strength of the teams.
Year
DOI
Venue
2017
10.1016/j.orl.2017.07.004
Operations Research Letters
Keywords
Field
DocType
Sports scheduling,Stable matching,Preferences,Integer programming
Stable roommates problem,Integer,Mathematical optimization,Tournament,Scheduling (computing),Linear model,Integer programming,Schedule,Mathematics
Journal
Volume
Issue
ISSN
45
5
0167-6377
Citations 
PageRank 
References 
0
0.34
10
Authors
2
Name
Order
Citations
PageRank
Mario Guajardo112712.49
Kurt Jørnsten223224.52