More on n-point, win-by-k games

DOI10.2307/3215061MaRDI QIDQ4891669zbMATH OpenOpenAlexFDO

Authors John Haigh

Publication date 11 March 1997

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

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

zbMATH Keywords

paired comparisonsMarkov chainsBernoulli trialsgambler's ruin

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) 2-person games (91A05) Probabilistic games; gambling (91A60)

Recommendations

• n-point, win-by-k games
• Probability of Winning at Tennis I. Theory and Data
• scientific article; zbMATH DE number 3978021
• scientific article; zbMATH DE number 2186867
• Gambler's ruin and winning a series by m games

Cited in

(9)

• scientific article; zbMATH DE number 2186867 (Why is no real title available?)
• n-point, win-by-k games
• Embedded polynomial plans of random walks and their applications
• Games of chance with multiple objectives
• Gambler's ruin and winning a series by m games
• On two combination rules for 0-1-sequences
• Sequential games
• Server advantage in tennis matches
• The Probability of a Tie in an n-Game Match

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

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