A finite exact algorithm to solve a dice game
- 24 March 2016
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 53 (1), 91-105
- https://doi.org/10.1017/jpr.2015.11
Abstract
We provide an algorithm to find the value and an optimal strategy of the Ten Thousand dice game solitaire variant in the framework of Markov control processes. Once an optimal critical threshold is found, the set of nonstopping states of the game becomes finite and the solution is found by a backwards algorithm that gives the values for each one of these states of the game. The algorithm is finite and exact. The strategy to find the critical threshold comes from the continuous pasting condition used in optimal stopping problems for continuous-time processes with jumps.Keywords
This publication has 8 references indexed in Scilit:
- A REAL-WORLD STOCHASTIC TWO-PERSON GAMEProbability in the Engineering and Informational Sciences, 2006
- Optimal strategy in a dice gameJournal of Applied Probability, 2000
- Optimal stopping for a diffusion with jumpsFinance and Stochastics, 1999
- Markov Control Processes with the Expected Total Cost Criterion: Optimality, Stability, and Transient ModelsActa Applicandae Mathematicae, 1999
- Optimal Stopping in a Dice GameJournal of Applied Probability, 1998
- Markov Decision ProcessesWiley Series in Probability and Statistics, 1994
- History of Probability and Statistics and Their Applications before 1750Wiley Series in Probability and Statistics, 1990
- ON THE TRANSIENT CASE FOR MARKOV DECISION CHAINS WITH GENERAL STATE SPACES11This research was supported under National Science Foundation Grant GK-37408.Published by Elsevier BV ,1978