Server advantage in tennis matches

DOI10.1239/JAP/1101840562zbMath1154.91363OpenAlexW2035304649MaRDI QIDQ4660541

Iain M. MacPhee, Jonathan Rougier, Graham Hilford Pollard

Publication date: 4 April 2005

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

Full work available at URL: https://semanticscholar.org/paper/db97aa06f28350ab6f9daf2fd3760becda64c273

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• AN ANALYSIS OF CLASSICAL AND TIE-BREAKER TENNIS
• More on n-point, win-by-k games

This page was built for publication: Server advantage in tennis matches