Determining the Number of Games Needed to Guarantee an NHL Playoff Spot

DOI10.1007/978-3-642-01929-6_18MaRDI QIDQ3630165zbMATH OpenOpenAlexFDO

Authors Tyrel Russell, P. van Beek

Publication date 3 June 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01929-6_18

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Points scoring systems in Formula 1: a game theoretic perspective
• Predicting wins and losses: a volleyball case study
• Computing the Number of Winning NFL Survivor Pool Entries
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
• Building a model for scoring 20 or more runs in a baseball game

Cited in

(2)

• Do professional hockey teams with a two-goal lead lose more often than they should?
• Predicting wins and losses: a volleyball case study

This page was built for publication: Determining the Number of Games Needed to Guarantee an NHL Playoff Spot

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630165)