n-point, win-by-k games

DOI10.2307/3214385zbMath0695.60015OpenAlexW2315684313MaRDI QIDQ3471254

Kyle T. Siegrist

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214385

zbMATH Keywords

random walkBernoulli trialsfirst-exit timegambler's ruin problemBanach's match problemreplication of a paired comparison

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (4)

Gambler's ruin and winning a series by \(m\) games ⋮ Order statistics and the length of the best-n-of-(2n − 1) competition ⋮ Embedded polynomial plans of random walks and their applications ⋮ The conditional gambler's ruin problem with ties allowed

This page was built for publication: n-point, win-by-k games