A General Pairwise Comparison Model for Extremely Sparse Networks
From MaRDI portal
Publication:6144758
DOI10.1080/01621459.2022.2053137arXiv2002.08853OpenAlexW3008580625MaRDI QIDQ6144758
Kani Chen, Yiming Xu, Ruijian Han
Publication date: 8 January 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.08853
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for paired comparison data: a review with emphasis on dependent data
- Binary choice probabilities: on the varieties of stochastic transitivity
- Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
- Limited information estimation and testing of Thurstonian models for preference data
- MM algorithms for generalized Bradley-Terry models.
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Limited information estimation and testing of Thurstonian models for paired comparison data under multiple judgment sampling
- Asymptotic theory of sparse Bradley-Terry model
- Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
- Sparse paired comparisons in the Bradley-Terry model
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- A continuum of paired comparisons models
- Solution of a Ranking Problem from Binary Comparisons
- Analysis of Ordinal Paired Comparison Data
- A paired comparison approach for the analysis of sets of Likert-scale responses
- Rank Centrality: Ranking from Pairwise Comparisons
This page was built for publication: A General Pairwise Comparison Model for Extremely Sparse Networks
