A stochastic analysis of some two-person sports
We consider two-person sports where each rally is initiated by a server, the other player (the receiver) becoming the server when he/she wins a rally. Historically, these sports used a scoring based on the side-out scoring system, in which points are only scored by the server. Recently, however, some federations have switched to the rally-point scoring system in which a point is scored on every rally. As various authors before us, we study how much this change affects the game. Our approach is based on a rally-level analysis of the process through which, besides the well-known probability distribution of the scores,we also obtain the distribution of the number of rallies. This yields a comprehensive knowledge of the process at hand, and allows for an in-depth comparison of both scoring systems. In particular, our results help to explain why the transition from one scoring system to the other has more important implications than those predicted from game-winning probabilities alone. Some of our findings are quite surprising, and unattainable through Monte Carlo experiments. Our results are of high practical relevance to international federations and local tournament organizers alike, and also open the way to fficient estimation of the rally-winning probabilities, which should have a significant impact on the quality of ranking procedures.
|Date of creation:||2009|
|Publication status:||Published by: ECARES|
|Contact details of provider:|| Postal: Av. F.D., Roosevelt, 39, 1050 Bruxelles|
Phone: (32 2) 650 30 75
Fax: (32 2) 650 44 75
Web page: http://difusion.ulb.ac.be
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:eca:wpaper:2009_025. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Benoit Pauwels)
If references are entirely missing, you can add them using this form.