Estimation of Skill Distribution from a Tournament

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.

[1]  P. Diaconis Group representations in probability and statistics , 1988 .

[2]  Devavrat Shah,et al.  Iterative ranking from pair-wise comparisons , 2012, NIPS.

[3]  L. Thurstone A law of comparative judgment. , 1994 .

[4]  E. Zermelo Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung , 1929 .

[5]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[6]  Richard A. Davis,et al.  Remarks on Some Nonparametric Estimates of a Density Function , 2011 .

[7]  Martin J. Wainwright,et al.  Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence , 2015, J. Mach. Learn. Res..

[8]  Yi-Ching Yao,et al.  Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons , 1999 .

[9]  Alexandre B. Tsybakov,et al.  Introduction to Nonparametric Estimation , 2008, Springer series in statistics.

[10]  Xi Chen,et al.  On Bayes Risk Lower Bounds , 2014, J. Mach. Learn. Res..

[11]  Arnaud Doucet,et al.  Efficient Bayesian Inference for Generalized Bradley–Terry Models , 2010, 1011.1761.

[12]  D. Hunter MM algorithms for generalized Bradley-Terry models , 2003 .

[13]  R. Duncan Luce,et al.  Individual Choice Behavior: A Theoretical Analysis , 1979 .

[14]  I. A. Ibragimov,et al.  Estimation of Distribution Density Belonging to a Class of Entire Functions , 1983 .

[15]  Ibrahim A. Ahmad,et al.  A nonparametric estimation of the entropy for absolutely continuous distributions (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[16]  F. Alajaji,et al.  Lectures Notes in Information Theory , 2000 .

[17]  R. Plackett The Analysis of Permutations , 1975 .

[18]  L. R. Ford Solution of a Ranking Problem from Binary Comparisons , 1957 .

[19]  Avrim Blum,et al.  Foundations of Data Science , 2020 .

[20]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[21]  Yuhong Yang,et al.  Information-theoretic determination of minimax rates of convergence , 1999 .

[22]  S. Sheather Density Estimation , 2004 .

[23]  Yuxin Chen,et al.  Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking , 2017, Annals of statistics.

[24]  V. A. Epanechnikov Non-Parametric Estimation of a Multivariate Probability Density , 1969 .

[25]  Devavrat Shah,et al.  Estimation of Skill Distributions , 2020, ArXiv.

[26]  John Guiver,et al.  Bayesian inference for Plackett-Luce ranking models , 2009, ICML '09.

[27]  Maxim Raginsky,et al.  Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation , 2016, IEEE Transactions on Information Theory.

[28]  S. Chatterjee,et al.  Matrix estimation by Universal Singular Value Thresholding , 2012, 1212.1247.

[29]  R. Khasminskii A Lower Bound on the Risks of Non-Parametric Estimates of Densities in the Uniform Metric , 1979 .

[30]  E. Parzen On Estimation of a Probability Density Function and Mode , 1962 .

[31]  J. Yellott The relationship between Luce's Choice Axiom, Thurstone's Theory of Comparative Judgment, and the double exponential distribution , 1977 .

[32]  D. McFadden Conditional logit analysis of qualitative choice behavior , 1972 .

[33]  A. Culyer Thurstone’s Law of Comparative Judgment , 2014 .

[34]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[35]  Martin J. Wainwright,et al.  Distance-based and continuum Fano inequalities with applications to statistical estimation , 2013, ArXiv.

[36]  M. Rosenblatt Remarks on Some Nonparametric Estimates of a Density Function , 1956 .

[37]  Tong Zhang,et al.  Information-theoretic upper and lower bounds for statistical estimation , 2006, IEEE Transactions on Information Theory.

[38]  L. Györfi,et al.  Nonparametric entropy estimation. An overview , 1997 .

[39]  R. A. Bradley,et al.  RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS THE METHOD OF PAIRED COMPARISONS , 1952 .

[40]  Devavrat Shah,et al.  Rank Centrality: Ranking from Pairwise Comparisons , 2012, Oper. Res..

[41]  Hao Li,et al.  Luck and the Law: Quantifying Chance in Fantasy Sports and Other Contests , 2018, SIAM Rev..