Simple, Robust and Optimal Ranking from Pairwise Comparisons

12/30/2015
by   Nihar B. Shah, et al.
0

We consider data in the form of pairwise comparisons of n items, with the goal of precisely identifying the top k items for some value of k < n, or alternatively, recovering a ranking of all the items. We analyze the Copeland counting algorithm that ranks the items in order of the number of pairwise comparisons won, and show it has three attractive features: (a) its computational efficiency leads to speed-ups of several orders of magnitude in computation time as compared to prior work; (b) it is robust in that theoretical guarantees impose no conditions on the underlying matrix of pairwise-comparison probabilities, in contrast to some prior work that applies only to the BTL parametric model; and (c) it is an optimal method up to constant factors, meaning that it achieves the information-theoretic limits for recovering the top k-subset. We extend our results to obtain sharp guarantees for approximate recovery under the Hamming distortion metric, and more generally, to any arbitrary error requirement that satisfies a simple and natural monotonicity condition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2021

Achievability and Impossibility of Exact Pairwise Ranking

We consider the problem of recovering the rank of a set of n items based...
research
06/28/2016

Active Ranking from Pairwise Comparisons and when Parametric Assumptions Don't Help

We consider sequential or active ranking of a set of n items based on no...
research
10/21/2021

Generalized Results for the Existence and Consistency of the MLE in the Bradley-Terry-Luce Model

Ranking problems based on pairwise comparisons, such as those arising in...
research
09/28/2021

Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method

Many applications such as recommendation systems or sports tournaments i...
research
07/05/2021

Poisoning Attack against Estimating from Pairwise Comparisons

As pairwise ranking becomes broadly employed for elections, sports compe...
research
06/16/2021

Recovery Guarantees for Time-varying Pairwise Comparison Matrices with Non-transitivity

Pairwise comparison matrices have received substantial attention in a va...
research
06/14/2022

A Truthful Owner-Assisted Scoring Mechanism

Alice (owner) has knowledge of the underlying quality of her items measu...

Please sign up or login with your details

Forgot password? Click here to reset