Abstract
Consider gambler’s ruin with three players, 1, 2, and 3, having initial capitals A, B, and C units. At each round a pair of players is chosen (uniformly at random) and a fair coin flip is made resulting in the transfer of one unit between these two players. Eventually, one of the players is eliminated and play continues with the remaining two. Let σ∈S3 be the elimination order (e.g., σ=132 means player 1 is eliminated first and player 3 is eliminated second, leaving player 2 with A+B+C units). We seek approximations (and exact formulas) for the elimination order probabilities PA,B,C(σ). Exact, as well as arbitrarily precise, computation of these probabilities is possible when N:=A+B+C is not too large. Linear interpolation can then give reasonable approximations for large N. One frequently used approximation, the independent chip model (ICM), is shown to be inadequate. A regression adjustment is proposed, which seems to give good approximations to the elimination order probabilities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
