Optimal full ranking from pairwise comparisons
From MaRDI portal
Publication:2148998
DOI10.1214/22-AOS2175MaRDI QIDQ2148998
Pinhan Chen, Anderson Y. Zhang, Chao Gao
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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranking by pairwise comparisons for Swiss-system tournaments
- The choice axiom after twenty years
- The structure of random utility models
- A common framework for deriving preference values from pairwise comparison matrices
- MM algorithms for generalized Bradley-Terry models.
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
- Worst-case versus average-case design for estimation from partial pairwise comparisons
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Minimax rates in permutation estimation for feature matching
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- A Brief Survey of Bandwidth Selection for Density Estimation
- Learning to Rank for Information Retrieval
- Implementing Quicksort programs
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Competitive analysis of the top-K ranking problem
- On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
- Minimax Rates and Efficient Algorithms for Noisy Sorting
- Subset Ranking Using Regression
- Rank Centrality: Ranking from Pairwise Comparisons
This page was built for publication: Optimal full ranking from pairwise comparisons
