scientific article; zbMATH DE number 7008316
From MaRDI portal
Publication:4614094
zbMath1412.62105MaRDI QIDQ4614094
Nir Ailon, Ori Davidov, I. F. D. Oliveira
Publication date: 30 January 2019
Full work available at URL: http://jmlr.csail.mit.edu/papers/v19/17-179.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
chesssensitivity analysismodel selectionsemi-definite programmingcomputer chesspaired comparisonsstatistical rankinglinear stochastic transitivity
Learning and adaptive systems in artificial intelligence (68T05) Paired and multiple comparisons; multiple testing (62J15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical ranking and combinatorial Hodge theory
- Dynamic paired-comparison scaling.
- The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution
- Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
- Stochastic transitivity: axioms and models
- Borda rule, Copeland method and strategic manipulation.
- How to solve a semi-infinite optimization problem
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Testable conditions for triads of paired comparison choices
- Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
- How Bad Are Vandermonde Matrices?
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Focused Information Criteria and Model Averaging for the Cox Hazard Regression Model
- There Are Many Models of Transitive Preference: A Tutorial Review and Current Perspective
- Interior-point methods for optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Stronger Players Need not Win More Knockout Tournaments
- Do Stronger Players Win More Knockout Tournaments?
- Random Knockout Tournaments
- Basic Geometry of Voting
- Semidefinite Programming
- One-step Local Quasi-likelihood Estimation
- Estimation in Tournaments and Graphs Under Monotonicity Constraints
- Maximum likelihood paired comparison ranking by linear programming
- Pairwise Comparison and Ranking: Optimum Properties of the Row Sum Procedure