×

Play like the pros? Solving the game of darts as a dynamic zero-sum game. (English) Zbl 07625888

Summary: The game of darts has enjoyed great growth over the past decade with the perception of darts moving from that of a pub game to a game that is regularly scheduled on prime-time television in many countries such as the United Kingdom, Germany, the Netherlands, and Australia, among others. It involves strategic interactions between two players, but to date, the literature has ignored these interactions. In this paper, we formulate and solve the game of darts as a dynamic zero-sum game (ZSG), and to the best of our knowledge, we are the first to do so. We also estimate individual skill models using a novel data set based on darts matches that were played by the top 16 professional players in the world during the 2019 season. Using the fitted skill models and our ZSG problem formulation, we quantify the importance of playing strategically – that is, taking into account the score and strategy of one’s opponent – when computing an optimal strategy. For top professionals, we find that playing strategically results in an increase in win probability of just \(0.2\%-0.6\%\) over a single leg but as much as 2.2% over a best-of-31-legs match.
Summary of Contribution: Dynamic zero-sum games (ZSGs) are of considerable interest, as they arise in many applications including sports, the management of communication networks, interdiction games, and heads-up poker – an important topic in modern artificial intelligence. In this study we consider the game of darts, which is growing increasingly popular around the world today. We formulate the game of darts as a ZSG and solve it iteratively by formulating each player’s best-response problem as a stochastic shortest-path (SSP) problem. We then solve these SSPs using standard dynamic programming methods. In solving the ZSG, we are able to accurately quantify the importance of top professionals playing strategically.

MSC:

90Cxx Mathematical programming

References:

[1] Baird G (2020) Optimising darts strategy using Markov decision processes and reinforcement learning. J. Oper. Res. Soc. 71(6):1020-1037.Crossref, Google Scholar · doi:10.1080/01605682.2019.1610341
[2] Bellos A (2013) Optimal dartboard hits the bullseye. Guardian (January 9), https://www.theguardian.com/science/alexs-adventures-in-numberland/2013/jan/09/optimal-dartboard-hits-bullseye.Google Scholar
[3] Bergman D, Imbrogno J (2017) Surviving a national football league survivor pool. Oper. Res. 65(5):1343-1354.Link, Google Scholar · Zbl 1383.90020
[4] Bertsekas DP, Yu H (2016) Stochastic shortest path problems under weak conditions. Laboratory for Information and Decision Systems Report LIDS-P-2909, Massachusetts Institute of Technology, Cambridge.Google Scholar
[5] Bowling M, Burch N, Johanson M, Tammelin O (2015) Heads-up limit hold’em poker is solved. Sci. 347(6218):145-149.Crossref, Google Scholar · doi:10.1126/science.1259433
[6] Brumbaugh-Smith JP, Shier DR (2002) Minimax models for diverse routing. INFORMS J. Comput. 14(1):81-95.Link, Google Scholar · Zbl 1238.90030
[7] Chan TCY, Singal R (2016) A Markov decision process-based handicap system for tennis. J. Quant. Anal. Sports 12(4):179-188.Google Scholar
[8] Che Y-K, Hendershott T (2008) How to divide the possession of a football? Econom. Lett. 99(3):561-565.Crossref, Google Scholar · Zbl 1255.91311 · doi:10.1016/j.econlet.2007.10.013
[9] Cokins G, Schrader D (2017) The sports analytics explosion. OR/MS Today 44(1):28-33.Google Scholar
[10] Fischetti M, Ljubić I, Monaci M, Sinnl M (2019) Interdiction games and monotonicity, with application to knapsack problems. INFORMS J. Comput. 31(2):390-410.Link, Google Scholar · Zbl 07281718
[11] Han CY, Lunday BJ, Robbins MJ (2016) A game theoretic model for the optimal location of integrated air defense system missile batteries. INFORMS J. Comput. 28(3):405-416.Link, Google Scholar · Zbl 1348.90396
[12] Haugh MB, Singal R (2021) How to play fantasy sports strategically (and win). Management Sci. 67(1):72-92.Link, Google Scholar
[13] Hunter DS, Vielma JP, Zaman T (2019) Picking winners in daily fantasy sports using integer programming. Working paper, Massachusetts Institute of Research, Cambridge.Google Scholar
[14] Kaplan EH, Garstka SJ (2001) March madness and the office pool. Management Sci. 47(3):369-382.Link, Google Scholar · Zbl 1232.90284
[15] Kaplan EH, Mongeon K, Ryan JT (2014) A Markov model for hockey: Manpower differential and win probability added. Inform. Systems Oper. Res. 52(2):39-50.Crossref, Google Scholar · Zbl 07683731 · doi:10.3138/infor.52.2.39
[16] Kohler D (1982) Optimal strategies for the game of darts. J. Oper. Res. Soc. 33(10):871-884.Crossref, Google Scholar · Zbl 0489.90100 · doi:10.1057/jors.1982.191
[17] Ötting M, Langrock R, Deutscher C, Leos-Barajas V (2020) The hot hand in professional darts. J. Roy. Statist. Soc. Ser. A 183(2):565-580.Crossref, Google Scholar · doi:10.1111/rssa.12527
[18] Palace A (2020) How darts flew from pastime to prime time. Economist (January 2), https://www.economist.com/britain/2020/01/02/how-darts-flew-from-pastime-to-prime-time.Google Scholar
[19] Patek SD, Bertsekas DP (1997) Stochastic shortest path games. SIAM J. Control Optim. 37(3):804-824.Crossref, Google Scholar · Zbl 0918.90148 · doi:10.1137/S0363012996299557
[20] Percy D (1999) Winning darts. Math. Today 35(2):54-57.Google Scholar · Zbl 1044.91503
[21] Sandholm T (2015) Solving imperfect-information games. Science 347(6218):122-123.Crossref, Google Scholar · doi:10.1126/science.aaa4614
[22] Shapley LS (1953) Stochastic games. Proc. Natl. Acad. Sci. USA 39(10):1095-1100.Crossref, Google Scholar · Zbl 0051.35805 · doi:10.1073/pnas.39.10.1095
[23] Stern HS, Wilcox W (1997) A statistician reads the sports pages. Chance 10(3):16-19.Crossref, Google Scholar · doi:10.1080/09332480.1997.10542036
[24] Tibshirani RJ, Price A, Taylor J (2011) A statistician plays darts. J. Roy. Statist. Soc. Ser. A 174(1):213-226.Crossref, Google Scholar · doi:10.1111/j.1467-985X.2010.00651.x
[25] Wright MB (2009) 50 years of OR in sport. J. Oper. Res. Soc. 60(Suppl 1):S161-S168.Google Scholar · Zbl 1168.90317
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.