2003
DOI: 10.1016/s0377-2217(02)00682-3
|View full text |Cite
|
Sign up to set email alerts
|

Forecasting the winner of a tennis match

Abstract: We propose a method to forecast the winner of a tennis match, not only at the beginning of the match, but also (and in particular) during the match. The method is based on a fast and exible computer program TENNISPROB, and on a statistical analysis of a large data set from Wimbledon, both at match a n d a t p o i n t l e v el.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
54
0
2

Year Published

2006
2006
2022
2022

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 95 publications
(63 citation statements)
references
References 6 publications
2
54
0
2
Order By: Relevance
“…A second model excluded the rank predictors, and a third model excluded player physical characteristics. In terms of a Brier score, the predictive performance of the full model was superior Klaassen and Magnus (2003) considered a logit model to predict match outcomes at the beginning of a match. Letting R i be the rank of the ith player, who is favored to win the match, and R j the rank of the jth opponent, the logistic model they propose is…”
Section: Regression-basedmentioning
confidence: 99%
“…A second model excluded the rank predictors, and a third model excluded player physical characteristics. In terms of a Brier score, the predictive performance of the full model was superior Klaassen and Magnus (2003) considered a logit model to predict match outcomes at the beginning of a match. Letting R i be the rank of the ith player, who is favored to win the match, and R j the rank of the jth opponent, the logistic model they propose is…”
Section: Regression-basedmentioning
confidence: 99%
“…If we assume that points are independent and identically distributed, then the only difference between levels of aggregation is the counting system. For example, we may find that (p, p * ) = (0.65, 0.66) at point level, which translates to game winning probabilities (g, g * ) = (0.83, 0.85) (see Klaassen and Magnus, 2003), so that the inefficiency measure increases from 1 − p/p * = 1.5% to 1 − g/g * = 1.9%. If a game is defined differently, then the inefficiency measure will change, even if players behave in the same way.…”
Section: Accepted M Manuscriptmentioning
confidence: 99%
“…But a player serves many points in a tennis match. Thus we study the impact at higher levels of aggregation, applying the software developed in Klaassen and Magnus (2003) to all p and p * . If we consider a game, then the impact of inefficiency increases, not because the players perform differently but because of the structure of the tennis scoring system: from 0.7%-points at point level to 1.1%-points at game level for the men, and from 1.2%-points at point level to 2.5%-points at game level for the women.…”
Section: Accepted M Manuscriptmentioning
confidence: 99%
“…Hence we also calculate the inefficiency at game-, set-, and match-level, using the software developed in Klaassen and Magnus (2003). If we consider a game, the inefficiency increases, not because the players perform differently but because of the structure of the tennis scoring system: from 1.1% at point level to 1.4% at game level for the men, and from 2.0% at point level to 4.0% at game level for the women.…”
Section: Efficiency Resultsmentioning
confidence: 99%