More on n-point, win-by-k games
From MaRDI portal
DOI10.2307/3215061zbMATH Open0857.90149OpenAlexW2032841136MaRDI QIDQ4891669FDOQ4891669
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
Recommendations
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)
Cited In (9)
- Title not available (Why is that?)
- 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)