Optimal full ranking from pairwise comparisons
From MaRDI portal
Publication:2148998
DOI10.1214/22-AOS2175MaRDI QIDQ2148998FDOQ2148998
Authors: Pinhan Chen, Chao Gao, Anderson Y. Zhang 
Publication date: 24 June 2022
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.08421
Recommendations
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Ranking and selection for pairwise comparison
- Complete ranking procedures with appropriate loss functions
- On a pairwise comparison-based consistent non-numerical ranking
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- The rankability of weighted data from pairwise comparisons
Cites Work
- MM algorithms for generalized Bradley-Terry models.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Brief Survey of Bandwidth Selection for Density Estimation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A common framework for deriving preference values from pairwise comparison matrices
- The structure of random utility models
- Ranking by pairwise comparisons for Swiss-system tournaments
- Implementing Quicksort programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The choice axiom after twenty years
- Noisy sorting without resampling
- On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Worst-case versus average-case design for estimation from partial pairwise comparisons
- Learning to Rank for Information Retrieval
- Rank Centrality: Ranking from Pairwise Comparisons
- Competitive analysis of the top-\(K\) ranking problem
- Subset Ranking Using Regression
- Minimax rates in permutation estimation for feature matching
- Minimax rates and efficient algorithms for noisy sorting
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
Cited In (10)
- An example of universal optimality in a full-rank model
- Optimal Full Ranking from Pairwise Comparisons
- A complete ranking of incomplete trapezoidal information
- Optimal permutation estimation in crowdsourcing problems
- The fullrank value function
- A prudent characterization of the ranked pairs rule
- Ranking with a P-Norm Push
- Lagrangian Inference for Ranking Problems
- On a pairwise comparison-based consistent non-numerical ranking
- Complete ranking procedures with appropriate loss functions
Uses Software
This page was built for publication: Optimal full ranking from pairwise comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148998)
