Generalized gambler's ruin problem: explicit formulas via Siegmund duality

From MaRDI portal
Publication:2397967

DOI10.1007/S11009-016-9507-6zbMATH Open1370.60120arXiv1604.05990OpenAlexW2340999293WikidataQ59608332 ScholiaQ59608332MaRDI QIDQ2397967FDOQ2397967

Paweł Lorek

Publication date: 14 August 2017

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: We give explicit formulas for ruin probabilities in a multidimensional Generalized Gambler's ruin problem. The generalization is best interpreted as a game of one player against d other players, allowing arbitrary winning and losing probabilities (including ties) depending on the current fortune with particular player. It includes many previous other generalizations as special cases. Instead of usually utilized first-step-like analysis we involve dualities between Markov chains. We give general procedure for solving ruin-like problems utilizing Siegmund duality in Markov chains for partially ordered state spaces studied recently in context of M"obius monotonicity.


Full work available at URL: https://arxiv.org/abs/1604.05990





Cites Work


Cited In (12)






This page was built for publication: Generalized gambler's ruin problem: explicit formulas via Siegmund duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397967)