Optimal full ranking from pairwise comparisons
From MaRDI portal
Publication:2148998
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
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- scientific article; zbMATH DE number 1734453 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- A Brief Survey of Bandwidth Selection for Density Estimation
- A common framework for deriving preference values from pairwise comparison matrices
- Competitive analysis of the top-\(K\) ranking problem
- Implementing Quicksort programs
- Learning to Rank for Information Retrieval
- MM algorithms for generalized Bradley-Terry models.
- Minimax rates and efficient algorithms for noisy sorting
- Minimax rates in permutation estimation for feature matching
- Noisy sorting without resampling
- On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
- Rank Centrality: Ranking from Pairwise Comparisons
- Ranking by pairwise comparisons for Swiss-system tournaments
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Subset Ranking Using Regression
- The choice axiom after twenty years
- The structure of random utility models
- Worst-case versus average-case design for estimation from partial pairwise comparisons
Cited in
(10)- An example of universal optimality in a full-rank model
- 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
- Optimal Full Ranking from Pairwise Comparisons
- On a pairwise comparison-based consistent non-numerical ranking
- Complete ranking procedures with appropriate loss functions
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)
