Model inference for ranking from pairwise comparisons
Not on the map. Why?
Abstract (arXiv)
We consider the problem of ranking objects from noisy pairwise comparisons, for example, ranking tennis players from the outcomes of matches. We follow a standard approach to this problem and assume that each object has an unobserved strength and that the outcome of each comparison depends probabilistically on the strengths of the comparands. However, we do not assume to know a priori how skills affect outcomes. Instead, we present an efficient algorithm for simultaneously inferring both the unobserved strengths and the function that maps strengths to probabilities. Despite this problem being under-constrained, we present experimental evidence that the conclusions of our Bayesian approach are robust to different model specifications. We include several case studies to exemplify the method on real-world data sets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 45 references that are in the map. First posted on arXiv 17 Dec 2025.
Builds on
6 of 45 references.
References · 6
- 2017The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardnesscited by 20
- 2017A physical model for efficient ranking in networkscited by 10
- 2023Luck, skill, and depth of competition in games and social hierarchiescited by 6
- 2015Generalized communities in networkscited by 4
- 2021Belief propagation for permutations, rankings, and partial orderscited by 4
- 2025The Bradley-Terry Stochastic Block Modelcited by 1
Built on by
Not cited yet.