English

Model inference for ranking from pairwise comparisons

Social and Information Networks 2025-12-18 v1 Machine Learning Machine Learning

Abstract

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.

Keywords

Cite

@article{arxiv.2512.15269,
  title  = {Model inference for ranking from pairwise comparisons},
  author = {Daniel Sánchez Catalina and George T. Cantwell},
  journal= {arXiv preprint arXiv:2512.15269},
  year   = {2025}
}
R2 v1 2026-07-01T08:28:52.589Z