Journal of Applied Probability

Server advantage in tennis matches

Iain MacPhee, Jonathan Rougier, and G. H. Pollard

Source: J. Appl. Probab. Volume 41, Number 4 (2004), 1182-1186.

Abstract

We show that the advantage that can accrue to the server in tennis does not necessarily imply that serving first changes the probability of winning the match. We demonstrate that the outcome of tie-breaks, sets and matches can be independent of who serves first. These are corollaries of a more general invariance result that we prove for n-point win-by-2 games. Our proofs are non-algebraic and self-contained.

Primary Subjects: 91A60, 91A05
Secondary Subjects: 60J20
Keywords: Tennis; tie-break; n-point win-by-k games

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.jap/1101840562
Digital Object Identifier: doi:10.1239/jap/1101840562
Mathematical Reviews number (MathSciNet): MR2122811
Zentralblatt MATH identifier: 02151065

References

Haigh, J. (1996). More on $n$-point, win-by-$k$ games. J. Appl. Prob. 33, 382--387.
Mathematical Reviews (MathSciNet): MR1385347
Kemeny, J. G. and Snell, J. L. (1960). Finite Markov Chains. Van Nostrand Reinhold, Princeton, NJ.
Mathematical Reviews (MathSciNet): MR115196
Zentralblatt MATH: 0089.13704
Klaassen, F. J. G. M. and Magnus, J. R. (2001). Are points in tennis independently and identically distributed? Evidence from a dynamic binary panel data model. J. Amer. Statist. Assoc. 96, 500--509.
Mathematical Reviews (MathSciNet): MR1939350
Digital Object Identifier: doi:10.1198/016214501753168217
Magnus, J. R. and Klaassen, F. J. G. M. (1999). On the advantage of serving first in a tennis set: four years at Wimbledon. Statistician 48, 247--256.
Pollard, G. H. (1983). An analysis of classical and tie-breaker tennis. Austral. J. Statist. 25, 496--505.
Mathematical Reviews (MathSciNet): MR737795
Pollard, G. H. and Noble, K. (2002). A solution to the unfairness of the tiebreak game when used in tennis doubles. In Proc. 6th Austral. Conf. Math. Comput. Sport, eds G. Cohen and T. Langtry, University of Technology, Sydney, pp. 231--235.
Pollard, G. H. and Noble, K. (2003a). A new tiebreak game with four proposed applications. In Tennis Science and Technology 2, ed. S. Miller, International Tennis Federation, London, pp. 317--324.
Pollard, G. H. and Noble, K. (2003b). A solution to the unfairness of tiebreak tennis doubles. In Tennis Science and Technology 2, ed. S. Miller, International Tennis Federation, London, pp. 325--332.
Pollard, G. H. and Noble, K. (2003c). Scoring to remove long matches, increase tournament fairness, and reduce injuries. Medicine Sci. Tennis 8, 12--13.
Riddle, L. H. (1988). Probability models for tennis scoring. Appl. Statist. 37, 63--75.

2010 © Applied Probability Trust