A network-based dynamical ranking system for competitive sports
@article{Motegi2012AND, title={A network-based dynamical ranking system for competitive sports}, author={Shun Motegi and Naoki Masuda}, journal={Scientific Reports}, year={2012}, volume={2} }
From the viewpoint of networks, a ranking system for players or teams in sports is equivalent to a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score of a player (or team) fluctuates over time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating…
55 Citations
A subgraph-based ranking system for professional tennis players
- Computer Science
- 2017
A ranking system which relies on the occurrences of 4-node directed subgraphs and the positions (or orbits) where the players appear on them to extract meaningful rankings which capture the intricate competitive relationships between players from different eras.
A Subgraph-Based Ranking System for Professional Tennis Players
- Computer ScienceCompleNet
- 2016
A ranking system which relies on the occurrences of 4-node directed subgraphs and the positions (or orbits) where the players appear on them to extract meaningful rankings which capture the intricate competitive relationships between players from different eras.
Time-dependent Network Algorithm for Ranking in Sports
- EducationActa Cybern.
- 2014
A novel ranking method which may be useful in sports like tennis, table tennis or American football, etc. is introduced and analyzed and it has a good predictive power.
Ranking Competitors Using Degree-Neutralized Random Walks
- Computer SciencePloS one
- 2014
This work proposes a ranking method based on the random walk on the network representing the competitors as nodes and competitions as directed edges with asymmetric weights that outperforms other methods including the baseline win–loss differential method in sparse networks.
Limits of PageRank-based ranking methods in sports data
- Computer Science, MathematicsArXiv
- 2020
A new PageRank variant is proposed which outperforms PageRank in all evaluated settings, yet shares its sensitivity to increased randomness in the data, which demonstrates the danger of using novel metrics and algorithms without considering their limits of applicability.
Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method
- Computer Science
- 2021
An extension of the classic BTL (Bradley-Terry-Luce) model for the static setting to a dynamic setup under the assumption that the probabilities of the pairwise outcomes evolve smoothly over the time domain [0, 1].
A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues
- EconomicsChaos
- 2013
A new technique to analyze families of rankings based on sports rankings and, more precisely, on soccer leagues is shown, which gives a generalization of the Kendall's correlation coefficient to more than two rankings.
Dynamic Ranking and Translation Synchronization
- Computer Science, Mathematics
- 2022
An extension of the translation synchronization problem, to the dynamic setting, is studied and two estimators are proposed – one based on a smoothness-penalized least squares approach and the other based on projection onto the low frequency eigenspace of a suitable smoothness operator.
The Evaluation of Rating Systems in Team-based Battle Royale Games
- Computer ScienceArXiv
- 2021
Among all metrics studied, normalized discounted cumulative gain (NDCG) demonstrated more reliable performance and more flexibility, and alleviated most of the challenges faced by the other metrics while adding the freedom to adjust the focus of the evaluations on different groups of players.
The Haka network: Evaluating rugby team performance with dynamic graph analysis
- Computer Science2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
- 2016
It is discovered that structural features that make networks resilient to disruptions are a good predictor of a team's performance, both at the global and at the local level, when deploying the dynamic graph analysis framework on data from 18 rugby matches.
References
SHOWING 1-10 OF 35 REFERENCES
A network-based ranking system for US college football
- Education
- 2005
American college football faces a conflict created by the desire to stage national championship games between the best teams of a season when there is no conventional play-off system for deciding…
Who Is the Best Player Ever? A Complex Network Analysis of the History of Professional Tennis
- Computer SciencePloS one
- 2011
A diffusion algorithm was developed and applied to the tennis contact network in order to rank professional players and Jimmy Connors was identified as the best player in the history of tennis according to the ranking procedure.
Dynamic Rating of Sports Teams
- Mathematics
- 2000
We consider the problem of dynamically rating sports teams on the basis of categorical outcomes of paired comparisons such as win, draw and loss in football. Our modelling framework is the cumulative…
An Iterative Procedure for Evaluating Digraph Competitions
- MathematicsAnn. Oper. Res.
- 2002
A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph and an iterative process is described that repeats this procedure: at each step the allocation obtained in the previous step determines the new input weights.
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
- Computer ScienceComputers and Games
- 2008
Experiments demonstrate that, in comparison to Elo, Glicko, TrueSkill, and decayed-history algorithms, WHR produces better predictions.
Which Ball is the Roundest? - A Suggested Tournament Stability Index
- Education, Mathematics
- 2006
All sports have components of randomness that cause the best individual or team not to win every game. According to many spectators this uncertainty is part of the charm when following a…
On Generalized Tournament Matrices
- Mathematics
- 1970
played (i.e., there are no ties). The outcome of the tournament may be represented by an n x n tournament matrix T where lij = 1 if player i defeats player j (symbolically, i -+ j) and zero…
Minimizing Game Score Violations in College Football Rankings
- EducationInterfaces
- 2005
Using a model for minimizing violations that exploits problem characteristics found in college football, it was found that all previous ranking systems generated violations that were at least 38 percent higher than the minimum.
TrueSkill™: A Bayesian Skill Rating System
- Computer Science
- 2007
We present a new Bayesian skill rating system which can be viewed as a generalisation of the Elo system used in Chess. The new system tracks the uncertainty about player skills, explicitly models…