Solution to the N -player gambler’s ruin using recursions based on multigraphs

DOI10.1080/03610918.2023.2233173MaRDI QIDQ6971467zbMATH OpenFDO

Authors Ramon Iñigo D. Marfil, Guido David

Publication date 13 June 2025

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2023.2233173

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10) (n)-person games, (n>2) (91A06) Probabilistic games; gambling (91A60)

Cites work

• A game based on successive events
• A matrix-analytic approach to the N-player ruin problem
• Calcul des probabilités. Tome I.
• Gambler's ruin and the ICM
• Gambler's ruin estimates on finite inner uniform domains
• scientific article; zbMATH DE number 6700637 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 621885 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• On the N-tower problem and related problems
• On the placing probabilities for the four-tower problem using recursions based on multigraphs
• The Computer Solves the Three Tower Problem
• The ruin time for 3-player gambler’s problem: an approximate formula
• The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations
• Three-handed gambler's ruin
• Variance of the asymmetric n-player gambler’s ruin problem with ties allowed

This page was built for publication: Solution to the N -player gambler’s ruin using recursions based on multigraphs

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