Bachet's game with lottery moves
Abstract
Bachet's game is a variant of the game of Nim. There are $n$ objects in one pile. Two players take turns to remove any positive number of objects not exceeding some fixed number $m$. The player who takes the last object loses. We consider a variant of Bachet's game in which each move is a lottery over set $\{1,2,\ldots, m\}$. The outcome of a lottery is the number of objects that player takes from the pile. We show that under some nondegenericity assumptions on the set of available lotteries the probability that the first player wins in subgame perfect Nash equilibrium converges to $1/2$ as $n$ tends to infinity.
 Publication:

arXiv eprints
 Pub Date:
 March 2019
 DOI:
 10.48550/arXiv.1903.08646
 arXiv:
 arXiv:1903.08646
 Bibcode:
 2019arXiv190308646D
 Keywords:

 Mathematics  Optimization and Control;
 91A18;
 91A60
 EPrint:
 12 pages. Minor revisions. To appear in "Discrete Mathematics"