Identifying teams eliminated from contention for first place of a sports league is a much studied problem. In the classic setting each game is played between two teams, and the team with the most wins finishes first. Recently, two papers [Way] and [AERO] detailed a surprising structural fact in the classic setting: At any point in the season, there is a computable threshold W such that a team is eliminated (cannot win or tie for first place) if and only if it cannot win W or more games. Using this threshold speeds up the identification of eliminated teams. We show that thresholds exist for a wide range of elimination problems (greatly generalizing the classical setting), via a simpler and more direct proof. For the classic setting we determine which teams can be the strict winner of the most games; examine these issues for multi-division leagues with playoffs and wildcards; and establish that certain elimination questions are NP-hard.
CITATION STYLE
Gusfield, D., & Martel, C. (1999). Thresholds for sports elimination numbers: Algorithms and oomplexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1663, pp. 330–341). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_33
Mendeley helps you to discover research relevant for your work.