Maximizing the variance of the time to ruin in a multiplayer game with selection

DOI10.1017/APR.2016.17zbMATH Open1347.91078OpenAlexW2409032505MaRDI QIDQ5740705FDOQ5740705

Ilie Grigorescu, Yi-Ching Yao

Publication date: 27 July 2016

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: http://projecteuclid.org/euclid.aap/1465490765

Recommendations

• scientific article; zbMATH DE number 1833412
• Extensions of gambler's ruin with even odds: multinomial and other models
• Variance of the game duration in the gambler's ruin problem
• The asymmetric \(n\)-player gambler's ruin problem with equal initial fortunes
• A Simple Solution to a Multiple Player Gambler's Ruin Problem

zbMATH Keywords

dynamic programmingmartingalestochastic controlgambler's ruinmultiplayer game

Mathematics Subject Classification ID

Combinatorial probability (60C05) Dynamic programming in optimal control and differential games (49L20) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stochastic control (93E20) Probabilistic games; gambling (91A60)

Cited In (1)

• The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations

This page was built for publication: Maximizing the variance of the time to ruin in a multiplayer game with selection

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