A Bayesian Approximation Method for Online Ranking

This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large online ranking systems are much needed. We consider game models in which a k-team game is treated as several two-team games. By approximating the expectation of teams' (or players') performances, we derive simple analytic update rules. These update rules, without numerical integrations, are very easy to interpret and implement. Experiments on game data show that the accuracy of our approach is competitive with state of the art systems such as TrueSkill, but the running time as well as the code is much shorter.

[1]  Ruby C. Weng,et al.  A Bayesian Edgeworth expansion by Stein's identity , 2010 .

[2]  Tom Minka,et al.  A family of algorithms for approximate Bayesian inference , 2001 .

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

[4]  R. A. Bradley,et al.  Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons , 1952 .

[5]  Chih-Jen Lin,et al.  Generalized Bradley-Terry Models and Multi-Class Probability Estimates , 2006, J. Mach. Learn. Res..

[6]  Ruby C. Weng,et al.  INTEGRABLE EXPANSIONS FOR POSTERIOR DISTRIBUTIONS FOR MULTIPARAMETER EXPONENTIAL FAMILIES WITH APPLICATIONS TO SEQUENTIAL CONFIDENCE LEVELS , 2000 .

[7]  C. Stein,et al.  Estimation with Quadratic Loss , 1992 .

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

[9]  Tony R. Martinez,et al.  A Bradley–Terry artificial neural network model for individual ratings in group competitions , 2008, Neural Computing and Applications.

[10]  L. Wasserman,et al.  Computing Bayes Factors by Combining Simulation and Asymptotic Approximations , 1997 .

[11]  C. Stein.  Estimation of the Mean of a Multivariate Normal Distribution , 1981 .

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

[13]  Mark E. Glickman.  Paired Comparison Models with Time-Varying Parameters , 1993 .

[14]  Michael Woodroofe,et al.  Very weak expansions for sequentially designed experiments: linear models , 1989 .

[15]  L. Tierney,et al.  Accurate Approximations for Posterior Moments and Marginal Densities , 1986 .

[16]  John Aitchison,et al.  Statistical diagnosis when basic cases are not classified with certainty , 1976 .

[17]  Brendan J. Frey,et al.  Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Functions on Graphs , 2008, J. Mach. Learn. Res..

[18]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[19]  A. Elo.  The rating of chessplayers, past and present , 1978 .

[20]  J. Marden.  Analyzing and Modeling Rank Data , 1996 .

[21]  M. Glickman.  Parameter Estimation in Large Dynamic Paired Comparison Experiments , 1999 .

[22]  Tom Minka,et al.  TrueSkillTM: A Bayesian Skill Rating System , 2006, NIPS.

[23]  Michael Woodroofe,et al.  Corrected confidence sets for sequentially designed experiments , 1997 .