Bachet's game with lottery moves

DOI10.1016/J.DISC.2019.111704zbMATH Open1457.91112arXiv1903.08646OpenAlexW2982612232WikidataQ126842907 ScholiaQ126842907MaRDI QIDQ2297722FDOQ2297722

Authors: Dmitry Dagaev, I. V. Schurov 

Publication date: 20 February 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1903.08646

Recommendations

• The lottery Blotto game
• Non-symmetric discrete General Lotto games
• Uniqueness of optimal strategies in Captain Lotto games
• Two-person red-and-black with bet-dependent win probabilities
• A probabilistic take-away game

zbMATH Keywords

game theorybackward inductionlotteriesBachet's game

Mathematics Subject Classification ID

Combinatorial games (91A46) Probabilistic games; gambling (91A60)

Cites Work

• Reexamination of the perfectness concept for equilibrium points in extensive games
• \(N\)-person Nim and \(N\)-person Moore's games
• A variant of Nim
• On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
• Sprague-Grundy function of symmetric hypergraphs

Cited In (1)

• The Borell-Ehrhard game

This page was built for publication: Bachet's game with lottery moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297722)