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.

• Type: Journal
• Year: 2011
• Where: JMLR
• Authors: Ruby C. Weng, Chih-Jen Lin
• Keywords: JMLR 2011, Online Ranking, Online Ranking Algorithms, Update Rules