Name
Abstract | ||
|---|---|---|
In the standard definition of the classical gambler's ruin game, a persistent player enters in a stochastic process with an initial budget b0, which is, round after round, either increased by 1 with probability p, or decreased by 1 with probability 1−p. The player wins the game if the budget reaches a given objective value g, and loses the game if the budget drops to zero (the gambler is ruined). This article introduces the decisional gambling process, where the parameter p is hidden, and the player has the possibility to stop the game at any round keeping earnings. In this case, the best a player can do is to maintain an estimate of p based on the observed outcomes, and use it to decide whether is better to stay or quit the game. The main contribution of this article is to bring the question of finding the optimal stopping time to the gambler's ruin game. Different heuristics are analyzed and evaluated according to their performance in maximizing the gambler's expected final budget. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ijar.2021.06.013 | International Journal of Approximate Reasoning |
Keywords | DocType | Volume |
Gambler's ruin,Stochastic process,Stopping time,Bayesian estimation | Journal | 137 |
Issue | ISSN | Citations |
1 | 0888-613X | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Filipo Perotto | 1 | 0 | 0.68 |
| Imen Trabelsi | 2 | 1 | 2.41 |
| Stéphanie Combettes | 3 | 0 | 0.34 |
| Valérie Camps | 4 | 90 | 17.42 |
| Nicolas Verstaevel | 5 | 0 | 0.34 |