Generalized gambler's ruin problem: explicit formulas via Siegmund duality
DOI10.1007/s11009-016-9507-6zbMath1370.60120arXiv1604.05990OpenAlexW2340999293WikidataQ59608332 ScholiaQ59608332MaRDI QIDQ2397967
Publication date: 14 August 2017
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05990
Markov chainspartial orderingMöbius monotonicityabsorption probabilitySiegmund dualitygeneralized gambler's ruin problem
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40) Probabilistic games; gambling (91A60)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong stationary duality for Möbius monotone Markov chains
- Gambler's ruin problem in several dimensions
- The asymmetric \(n\)-player gambler's ruin problem with equal initial fortunes
- Strong stationary times via a new form of duality
- Gambler's ruin and winning a series by \(m\) games
- On the gambler's ruin problem for a finite Markov chain
- The gambler's ruin problem for a Markov chain related to the Bessel process
- The conditional gambler's ruin problem with ties allowed
- A duality relation for entrance and exit laws for Markov processes
- The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes
- Wall and Siegmund duality relations for birth and death chains with reflecting barrier
- Risk and duality in multidimensions
- Absorption probabilities for a random walk between two partially absorbing boundaries: I
- Pascal's Problem: The 'Gambler's Ruin'
- An Attrition Problem of Gambler's Ruin
- Markov Chains
- Siegmund duality with applications to the neutral Moran model conditioned on never being absorbed
- Negative quasi-probability as a resource for quantum computation
- Monotone Stochastic Recursions and their Duals
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: Generalized gambler's ruin problem: explicit formulas via Siegmund duality