Skip to Main content Skip to Navigation
Conference papers

Markov Chain Solution to the 3-Tower Problem

Abstract : The 3-tower problem is a 3-player gambler’s ruin model where two players are involved in a zero information, even-money bet during each round. The probabilities that each player accumulates all the money has a trivial solution. However, the probability of each player getting ruined first is an open problem. In this paper, the 3-tower problem recursions are modeled as a directed multigraph with loops, which is used to construct a Markov chain. The solution leads to exact values, and results show that, unlike in other models where the first ruin probabilities depend only on the proportion of chips of each player, the probabilities obtained by this model depend on the number of chips each player holds.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01466211
Contributor : Hal Ifip <>
Submitted on : Monday, February 13, 2017 - 2:30:42 PM
Last modification on : Sunday, November 22, 2020 - 11:14:02 AM
Long-term archiving on: : Sunday, May 14, 2017 - 2:07:26 PM

File

978-3-319-24315-3_12_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Guido David. Markov Chain Solution to the 3-Tower Problem. 3rd International Conference on Information and Communication Technology-EurAsia (ICT-EURASIA) and 9th International Conference on Research and Practical Issues of Enterprise Information Systems (CONFENIS), Oct 2015, Daejon, South Korea. pp.121-128, ⟨10.1007/978-3-319-24315-3_12⟩. ⟨hal-01466211⟩

Share

Metrics

Record views

226

Files downloads

578