When to challenge a call in tennis: A Markov decision process approach
暂无分享,去创建一个
[1] J. B. Keller,et al. Probability of Winning at Tennis I. Theory and Data , 2005 .
[2] Stephen R. Clarke. Dynamic Programming in One-Day Cricket-Optimal Scoring Rates , 1988 .
[3] Clyde Arthur Morrison,et al. Theory and Data , 1992 .
[4] Stephen R. Clarke,et al. Optimal challenges in tennis , 2012, J. Oper. Res. Soc..
[5] Graham Pollard,et al. Applying Strategies to the Tennis Challenge System , 2010 .
[6] John M. Norman,et al. Dynamic Programming in Tennis—When to Use a Fast Serve , 1985 .
[7] U. Rieder,et al. Markov Decision Processes , 2010 .
[8] Keith A. Willoughby,et al. An Analysis of a Strategic Decision in the Sport of Curling , 2005, Decis. Anal..
[9] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[10] J. Eric Bickel. On the Decision to Take a Pitch , 2009, Decis. Anal..
[11] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[12] Vamsi Krishna Nadimpalli. An average cost Markov decision process model to decide when to challenge a call in a tennis match , 2010 .
[13] P. O'Donoghue,et al. The Most Important Points in Grand Slam Singles Tennis , 2001, Research quarterly for exercise and sport.
[14] Robert E. Machol,et al. Note---Optimal Strategies on Fourth Down , 1978 .
[15] Shimon Kolkowitz,et al. On the Optimality of Line Call Challenges in Professional Tennis , 2012 .
[16] J. Magnus,et al. Are Points in Tennis Independent and Identically Distributed? Evidence From a Dynamic Binary Panel Data Model , 2001 .
[17] David Whitney,et al. Perceptual mislocalization of bouncing balls by professional tennis referees , 2008, Current Biology.
[18] David K. Smith,et al. Dynamic Programming and Optimal Control. Volume 1 , 1996 .