Fetching the paper…
Reading the bibliography…
There has been a recent surge of interest in studying permutation-based models for ranking from pairwise comparison data.
A law of comparative judgment
L. L. Thurstone · 1927
Earlier work this paper cites.
Rank analysis of incomplete block designs. I. The method of paired comparisons
R. A. Bradley and M. E. Terry · 1952
Earlier work this paper cites.
Individual choice behavior: A theoretical analysis
R. D. Luce · 1959
Earlier work this paper cites.
An Introduction to Probability Theory and Its Applications , volume 1
W. Feller · 1968
Earlier work this paper cites.
Spearman’s footrule as a measure of disarray
P. Diaconis and R. L. Graham · 1977
Earlier work this paper cites.
Asymptotic methods in statistical decision theory
L. Le Cam · 1986
Earlier work this paper cites.
Condorcet’s theory of voting
H. P. Young · 1988
Earlier work this paper cites.
Tutorial on large deviations for the binomial distribution
R. Arratia and L. Gordon · 1989
Earlier work this paper cites.
Aggregation and social choice: A mean voter theorem
A. Caplin and B. Nalebuff · 1991
Earlier work this paper cites.
Coloring random and semi-random k-colorable graphs
A. Blum and J. Spencer · 1995
Earlier work this paper cites.
The art of computer programming. Vol. 3
D. E. Knuth · 1998
Earlier work this paper cites.
Sorting: A Distribution Theory
H. M. Mahmoud · 2000
Earlier work this paper cites.
Rank aggregation methods for the web
C. Dwork, R. Kumar, M. Naor, and D. Sivakumar · 2001
Earlier work this paper cites.
MM algorithms for generalized Bradley-Terry models
D. R. Hunter · 2004
Earlier work this paper cites.
Ranking tournaments
N. Alon · 2006
Earlier work this paper cites.
How to rank with few errors
C. Kenyon-Mathieu and W. Schudy · 2007
Cited alongside, same era.
Concentration inequalities and model selection: Ecole d’Eté de Probabilités de Saint-Flour XXXIII - 2003
P. Massart · 2007
Cited alongside, same era.
Aggregating inconsistent information: Ranking and clustering
N. Ailon, M. Charikar, and A. Newman · 2008
Cited alongside, same era.
Noisy sorting without resampling
M. Braverman and E. Mossel · 2008
Cited alongside, same era.
Sorting from noisy information
M. Braverman and E. Mossel · 2009
Cited alongside, same era.
Learning to rank for information retrieval
T.-Y. Liu · 2009
Cited alongside, same era.
Minimax-optimal inference from partial rankings
B. Hajek, S. Oh, and J. Xu · 2014
Later among the works it cites.
A statistical convergence perspective of algorithms for rank aggregation from pairwise data
A. Rajkumar and S. Agarwal · 2014
Later among the works it cites.
Matrix estimation by universal singular value thresholding
Sourav Chatterjee · 2015
Later among the works it cites.
Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence
N. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright · 2015
Later among the works it cites.
On ranking and choice models
S. Agarwal · 2016
Later among the works it cites.
On estimation in tournaments and graphs under monotonicity constraints
Sabyasachi Chatterjee and Sumit Mukherjee · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Introduction to Nonparametric Estimation
A. B. Tsybakov · 2009
Cited alongside, same era.
Group recommendations with rank aggregation and collaborative filtering
L. Baltrunas, T. Makcinskas, and F. Ricci · 2010
Cited alongside, same era.
Codes in permutations and error correction for rank modulation
A. Barg and A. Mazumdar · 2010
Cited alongside, same era.
Active ranking using pairwise comparisons
K. G. Jamieson and R. D. Nowak · 2011
Cited alongside, same era.
Iterative ranking from pair-wise comparisons
S. Negahban, S. Oh, and D. Shah · 2012
Cited alongside, same era.
Sorting noisy data with partial information
K. Makarychev, Y. Makarychev, and A. Vijayaraghavan · 2013
Cited alongside, same era.
Later among the works it cites.
Minimax rates in permutation estimation for feature matching
O. Collier and A. S. Dalalyan · 2016
Later among the works it cites.
Optimal rates of statistical seriation
N. Flammarion, C. Mao, and P. Rigollet · 2016
Later among the works it cites.
Active ranking from pairwise comparisons and when parametric assumptions don’t help
R. Heckel, N. B. Shah, K. Ramchandran, and M. J. Wainwright · 2016
Later among the works it cites.
How robust are reconstruction thresholds for community detection?
A. Moitra, W. Perry, and A. S. Wein · 2016
Later among the works it cites.
Rank centrality: Ranking from pairwise comparisons
S. Negahban, S. Oh, and D. Shah · 2016
Later among the works it cites.
When can we rank well from comparisons of o ( n log ( n ) ) o(n\log(n)) non-actively chosen pairs?
A. Rajkumar and S. Agarwal · 2016
Later among the works it cites.
Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons
A. Agarwal, S. Agarwal, S. Assadi, and S. Khanna · 2017
Closest in time.
Learning from comparisons and choices
S. Negahban, S. Oh, K. K. Thekumparampil, and J. Xu · 2017
Closest in time.