Markov Chain Solution to the 3-Tower Problem - Information and Communication Technology Access content directly
Conference Papers Year : 2015

Markov Chain Solution to the 3-Tower Problem

Guido David
  • Function : Author
  • PersonId : 1001263


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.
Fichier principal
Vignette du fichier
978-3-319-24315-3_12_Chapter.pdf (245.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01466211 , version 1 (13-02-2017)





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⟩
161 View
470 Download



Gmail Facebook X LinkedIn More