Variance of the asymmetric n-player gambler’s ruin problem with ties allowed
From MaRDI portal
Publication:5084937
DOI10.1080/03610918.2017.1319479OpenAlexW2609870354MaRDI QIDQ5084937
No author found.
Publication date: 29 June 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2017.1319479
ruin timethree-tower problemgambler's ruin problemasymmetric play\(n\)-player gambler's ruinvariance of the ruin time
Related Items (2)
A novel version for three-player gambler's ruin problem ⋮ The ruin time for 3-player gambler’s problem: an approximate formula
Cites Work
- Unnamed Item
- Unnamed Item
- Variance of the game duration in the gambler's ruin problem
- The asymmetric \(n\)-player gambler's ruin problem with ties allowed and simulation
- Gambler's ruin problem in several dimensions
- The asymmetric \(n\)-player gambler's ruin problem with equal initial fortunes
- The conditional gambler's ruin problem with ties allowed
- A game with three players
- A computer algebra approach to the discrete Dirichlet problem
- Moments in the duration of play
- A game with four players
- The gambler's ruin problem with \(n\) players and asymmetric play
- The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations
- Pascal's Problem: The 'Gambler's Ruin'
- The Computer Solves the Three Tower Problem
- A Type of "Gambler's Ruin" Problem
This page was built for publication: Variance of the asymmetric n-player gambler’s ruin problem with ties allowed