REVIEW 1 cited by
Understanding and Pushing the Limits of the Elo Rating Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This work is concerned with the rating of players/teams in face-to-face games with three possible outcomes: loss, win, and draw. This is one of the fundamental problems in sport analytics, where the very simple and popular, non-trivial algorithm was proposed by Arpad Elo in late fifties to rate chess players. In this work we explain the mathematical model underlying the Elo algorithm and, in particular, we explain what is the implicit but not yet spelled out, assumption about the model of draws. We further extend the model to provide flexibility and remove the unrealistic implicit assumptions of the Elo algorithm. This yields the new rating algorithm, we call $\kappa$-Elo, which is equally simple as the Elo algorithm but provides a possibility to adjust to the frequency of draws. The discussion of the importance of the appropriate choice of the parameters is carried out and illustrated using results from English Premier League football seasons.
Forward citations
Cited by 1 Pith paper
-
Elo Ratings in the Presence of Intransitivity
Elo ratings in intransitive games are unique for a given schedule but shift with the schedule, so they cannot represent a single transitive skill scale.
Discussion (0). Continue with ORCID to comment.