Papers › Predicting outcomes for games of skill by redefining what it means to win
Predicting outcomes for games of skill by redefining what it means to win
J. Scott Moreland, Matthew C. Superdock
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Elo rating system is a highly successful ranking algorithm for games of skill where, by construction, one team wins and the other loses. A primary limitation of the original Elo algorithm is its inability to predict information beyond a match's win-loss probability. Specifically, the victor is awarded the same point bounty if he beats a team by 1 point or 10 points; only the rating difference between the team and its opponent affects the match bounty. In this work, we explain that Elo ratings and predictions can be naturally extended to include margin-of-victory information by simply redefining "what it means to win." We create ratings for each value of the margin-of-victory and use these ratings to predict the full distribution of point spread outcomes for matches which have not yet been played.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections