| Article ID: | iaor19982925 |
| Country: | Germany |
| Volume: | 45 |
| Issue: | 2 |
| Start Page Number: | 197 |
| End Page Number: | 211 |
| Publication Date: | Jan 1997 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Baston V.J., Garnaev A.Y. |
| Keywords: | Nash theory and methods |
The division of a cake by two players is modelled by means of a game of timing in which the players have a probability of learning when their opponent acts. It is shown that the game has a unique Nash equilibrium when both players are non-noisy but that there are many Nash equilibria including pure ones when at least one of the players is noisy. Explicit expressions for the strategies used in these Nash equilibria are obtained.