Tuinsma, T. (2016) Binary Markov Games and Tennis Matches. Bachelor's Thesis, Mathematics.
|
Text
Bachelor_Thesis_Final_Version.pdf - Published Version Download (337kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf - Other Restricted to Backend only Download (106kB) |
Abstract
In this paper a class of games called binary Markov games will be introduced. These can be used to model tennis matches. Equilibrium strategies for the two players in a tennis match are established. Based on these strategies, both players’ probabilities to win the match are calculated, as well as the expected number of points in a match. Finally the strength of the players in the longest tennis match in history can be estimated using the expected number of points in a tennis match.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 08:11 |
| Last Modified: | 15 Feb 2018 08:11 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/13761 |
Actions (login required)
 |
View Item |