Using Game Theory to Optimize Performance in a Best-of-N Set Match
This paper analyzes the situation in a best-of-N set match, where both players/teams are given the opportunity to increase their probability of winning a set (increase in effort) on one particular set. To gain insight to the problem, a best-of-3 set match (as typically used in tennis) is analyzed. Using game theory to obtain an optimal solution, the results indicate that both players should use a mixed strategy, by applying their increase in effort at each set with a probability of one third. A conjecture is devised to obtain an optimal solution for a best-of-N set match. Some applications are given to the theoretical results, which could be used by coaches and players to optimize performance.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 6 (2010)
Issue (Month): 2 (April)
|Contact details of provider:|| Web page: https://www.degruyter.com|
|Order Information:||Web: https://www.degruyter.com/view/j/jqas|
When requesting a correction, please mention this item's handle: RePEc:bpj:jqsprt:v:6:y:2010:i:2:n:2. 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: (Peter Golla)
If references are entirely missing, you can add them using this form.