Variance of the asymmetric n-player gambler’s ruin problem with ties allowed
From MaRDI portal
Publication:5084937
Cites work
- scientific article; zbMATH DE number 3179414 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- A Type of "Gambler's Ruin" Problem
- A computer algebra approach to the discrete Dirichlet problem
- A game with four players
- A game with three players
- Gambler's ruin problem in several dimensions
- Moments in the duration of play
- Pascal's Problem: The 'Gambler's Ruin'
- The Computer Solves the Three Tower Problem
- The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations
- The asymmetric n-player gambler's ruin problem with equal initial fortunes
- The asymmetric \(n\)-player gambler's ruin problem with ties allowed and simulation
- The conditional gambler's ruin problem with ties allowed
- The gambler's ruin problem with n players and asymmetric play
- Variance of the game duration in the gambler's ruin problem
Cited in
(7)- A novel version for three-player gambler's ruin problem
- Variance of the game duration in the gambler's ruin problem
- scientific article; zbMATH DE number 6700637 (Why is no real title available?)
- The conditional gambler's ruin problem with ties allowed
- The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations
- On the moments of the asymmetric \(n\)-player gambler's ruin problem
- The ruin time for 3-player gambler’s problem: an approximate formula
This page was built for publication: Variance of the asymmetric n-player gambler’s ruin problem with ties allowed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084937)