Model inference for ranking from pairwise comparisons

Daniel Sánchez Catalina, George T. Cantwell
12/17/2025
cs.SIcs.LGstat.ML

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{catalina2025model,
  title  = {Model inference for ranking from pairwise comparisons},
  author = {Daniel Sánchez Catalina and George T. Cantwell},
  year   = {2025},
  eprint = {2512.15269},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.15269v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.15269.svg)](https://codeofpaper.com/paper/2512.15269)

Discussion