Abstract
A problem of intense interest to many sports fans as a season progresses is whether their favorite team has mathematically clinched a playoff spot; i.e., whether there is no possible scenario under which their team will not qualify. In this paper, we consider the problem of determining when a National Hockey League (NHL) team has clinched a playoff spot. The problem is known to be NP-Complete and current approaches are either heuristic, and therefore not always announced as early as possible, or are exact but do not scale up. In contrast, we present an approach based on constraint programming which is fast and exact. The keys to our approach are the introduction of dominance constraints and special-purpose propagation algorithms. We experimentally evaluated our approach on the past two seasons of the NHL. Our method could show qualification before the results posted in the Globe and Mail, a widely read newspaper which uses a heuristic approach, and each instance was solved within seconds. Finally, we used our solver to examine the effect of scoring models on elimination dates. We found that the scoring model can affect the date of clinching on average by as much as two days and can result in different teams qualifying for the playoffs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, I., Erera, A.L., Hochbaum, D.S., Olinick, E.V.: Baseball, optimization and the world wide web. Interfaces 32, 12–22 (2002)
Banerjee, A.N., Swinnen, J.F.M., Weersink, A.: Skating on thin ice: rule changes and team strategies in the NHL. Can. J. of Economics 40, 493–514 (2007)
Bessiere, C.: Constraint propagation. In: The Handbook of Constraint Programming, ch. 3, Elsevier, Amsterdam (2006)
Cheng, E., Steffy, D.: Clinching and elimination of playoff berth in the NHL. International Journal of Operations Research (to appear)
Getoor, L., Ottosson, G., Fromherz, M., Carlson, B.: Effective redundant constraints for online scheduling. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI), pp. 302–307 (1997)
Globe and Mail. Hockey scoreboard. Metro ed. (2006-2007)
ILOG S.A. ILOG Solver 4.2 user’s manual (1998)
Kern, W., Paulusma, D.: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization 1, 205–214 (2004)
Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143, 151–188 (2003)
Marriott, K., Stuckey, P.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)
Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research 12, 375–386 (2005)
Robinson, L.W.: Baseball playoff eliminations: an application of linear programming. Operations Research Letters 10, 67–74 (1991)
Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Schwartz, B.: Possible winners in partially completed tournaments. SIAM Review 8, 302–308 (1966)
Smith, B.M.: Modelling. In: Handbook of Constraint Programming, ch. 11, Elsevier, Amsterdam (2006)
Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM Journal on Discrete Mathematics 14, 223–229 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Russell, T., van Beek, P. (2008). Mathematically Clinching a Playoff Spot in the NHL and the Effect of Scoring Systems. In: Bergler, S. (eds) Advances in Artificial Intelligence. Canadian AI 2008. Lecture Notes in Computer Science(), vol 5032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68825-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-68825-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68821-1
Online ISBN: 978-3-540-68825-9
eBook Packages: Computer ScienceComputer Science (R0)