Estimation of Skill Distribution from a Tournament
Ali Jadbabaie, Anuran Makur, Devavrat Shah
Abstract
In this paper, we study the problem of learning the skill distribution of a population of agents from observations of pairwise games in a tournament. These games are played among randomly drawn agents from the population. The agents in our model can be individuals, sports teams, or Wall Street fund managers. Formally, we postulate that the likelihoods of outcomes of games are governed by the parametric Bradley-Terry-Luce (or multinomial logit) model, where the probability of an agent beating another is the ratio between its skill level and the pairwise sum of skill levels, and the skill parameters are drawn from an unknown, non-parametric skill density of interest. The problem is, in essence, to learn a distribution from noisy, quantized observations. We propose a surprisingly simple and tractable algorithm that learns the skill density with near-optimal minimax mean squared error scaling as n -1+ε , for any ε > 0, so long as the density is smooth. Our approach brings together prior work on learning skill parameters from pairwise comparisons with kernel density estimation from non-parametric statistics. Furthermore, we prove information theoretic lower bounds which establish minimax optimality of the skill parameter estimation technique used in our algorithm. These bounds utilize a continuum version of Fano's method along with a careful covering argument. We apply our algorithm to various soccer leagues and world cups, cricket world cups, and mutual funds. We find that the entropy of a learnt distribution provides a quantitative measure of skill, which in turn provides rigorous explanations for popular beliefs about perceived qualities of sporting events, e.g., soccer league rankings. Finally, we apply our method to assess the skill distributions of mutual funds. Our results shed light on the abundance of low quality funds prior to the Great Recession of 2008, and the domination of the industry by more skilled funds after the financial crisis.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Entrywise Error Bounds for Spectral Ranking with Semi-Random AdversariesDongmin Lee, Anuran Makur, Japneet SinghKDD 2026
- Hypothesis Testing for Generalized Thurstone ModelsAnuran Makur, Japneet SinghICML 2025
Related papers
- Minimax Rate for Learning From Pairwise Comparisons in the BTL ModelJulien M. Hendrickx, Alex Olshevsky, Venkatesh SaligramaICML 2020 · 16 citations
- Generalized Results for the Existence and Consistency of the MLE in the Bradley-Terry-Luce ModelHeejong Bong, Alessandro RinaldoICML 2022 · 23 citations
- An Analysis of Elo Rating Systems via Markov ChainsSam Olesker-Taylor, Luca ZanettiNeurIPS 2024 · 9 citations
- On The Structure of Parametric Tournaments with Application to Ranking from Pairwise ComparisonsVishnu Veerathu, Arun RajkumarNeurIPS 2021 · 2 citations
- Score-Based Density Estimation from Pairwise ComparisonsPetrus Mikkola, Luigi Acerbi, Arto KlamiICLR 2026
