Using game theory to optimize performance in a best-of-N set match

Search Swinburne Research Bank

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/204563

Title: Using game theory to optimize performance in a best-of-N set match
Author(s): Barnett, Tristan; Zeleznikow, John; MacMahon, Clare
Abstract: 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.
Publication type: Journal article
Source: Journal of Quantitative Analysis in Sports, Vol. 6, no. 2 (2010), article no. 2
Publication year: 2010
FOR Code(s): 0104 Statistics; 0913 Mechanical Engineering
Keyword(s): Best-of-N set match; Game theory; Optimisation
Publisher: Berkeley Electronic Press
ISSN: 1559-0410
Publisher URL: http://dx.doi.org/10.2202/1559-0410.1228
Peer reviewed