In the gambler's ruin problem for \(n \geq 3\) players, each player tosses a fair coin, and if one of them gets a result different from those of the others, he collects one unit from each of the others. Starting with certain initial fortunes \(a_1, \ldots, a_n\), \(T(a_1, \ldots, a_n)\) denotes the time until at least one of the players is ruined. The author treats this problem for \(n = 4\) and computes \(ET (a,a,a,a)\) when the initial fortunes are equal.
Recommendations
Cites work
Cited in
(14)- A game with three players
- The gambler's ruin problem with n players and asymmetric play
- The symmetric \(4\)-player gambler's problem with unequal initial stakes
- The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations
- On the N-tower problem and related problems
- Variance of the game duration in the gambler's ruin problem
- scientific article; zbMATH DE number 830055 (Why is no real title available?)
- Variance of the asymmetric n-player gambler’s ruin problem with ties allowed
- Three-handed gambler's ruin
- The ruin time for 3-player gambler’s problem: an approximate formula
- The asymmetric \(n\)-player gambler's ruin problem with ties allowed and simulation
- On the moments of the asymmetric n-player gambler's ruin problem
- The asymmetric n-player gambler's ruin problem with equal initial fortunes
- Three-gambler ruin game: a game theoretic analysis
This page was built for publication: A game with four players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892965)