Efficient inference of rankings from multi-body comparisons

TL;DR

This paper introduces a faster algorithm for the Plackett-Luce model to accurately infer rankings from multi-body comparisons, validated on synthetic and real data, outperforming traditional pairwise methods.

Contribution

The paper presents a novel, efficient implementation of the PL model for multi-body comparisons, enabling scalable and accurate ranking inference in complex systems.

Findings

The new algorithm significantly speeds up PL ranking computations.

PL models trained on true multi-body data outperform those trained on pairwise projections.

Multi-body comparison data improves predictive accuracy of rankings.

Abstract

Many of the existing approaches to assess and predict the performance of players, teams or products in competitive contests rely on the assumption that comparisons occur between pairs of such entities. There are, however, several real contests where more than two entities are part of each comparison, e.g., sports tournaments,multiplayer board and card games, and preference surveys. The Plackett-Luce (PL) model provides a principled approach to infer the ranking of entities involved in such contests characterized by multi-body comparisons. Unfortunately, traditional algorithms used to compute PL rankings suffer from slow convergence limiting the application of the PL model to relatively small-scale systems. We present here an alternative implementation that allows for significant speed-ups and validate its efficiency in both synthetic and real-world sets of data. Further, we perform systematic cross-validation tests concerning the ability of the PL model to predict unobserved comparisons. We find that a PL model trained on a set composed of multi-body comparisons is more predictive than a PL model trained on a set of projected pairwise comparisons derived from the very same training set, emphasizing the need of properly accounting for the true multi-body nature of real-world systems whenever such an information is available.