Simple, Robust and Optimal Ranking from Pairwise Comparisons

zbMath1473.62078arXiv1512.08949MaRDI QIDQ4558526

Nihar B. Shah, Martin J. Wainwright

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1512.08949

zbMATH Keywords

rankingpairwise comparisonsOccam's razorBorda countapproximate recoverypermutation-based modelsset recovery

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15)

Related Items (15)

Low Permutation-rank Matrices: Structural Properties and Noisy Completion ⋮ Top-\(\kappa\) selection with pairwise comparisons ⋮ Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method ⋮ Optimal full ranking from pairwise comparisons ⋮ Robust Learning of Consumer Preferences ⋮ Ranking and selection for pairwise comparison ⋮ Subset simulation for probabilistic computer models ⋮ \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Active ranking from pairwise comparisons and when parametric assumptions do not help ⋮ Ranking recovery from limited pairwise comparisons using low-rank matrix completion ⋮ Spectral method and regularized MLE are both optimal for top-\(K\) ranking ⋮ Optimizing positional scoring rules for rank aggregation ⋮ Time-homogeneous top-K ranking using tensor decompositions

Uses Software

• CellProfiler

Cites Work

• Optimal aggregation algorithms for middleware.
• MM algorithms for generalized Bradley-Terry models.
• Matrix estimation by universal singular value thresholding
• Choice by elimination
• Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Inferring Rankings Using Constrained Sensing
• Database Theory - ICDT 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple, Robust and Optimal Ranking from Pairwise Comparisons