Fetching the paper…
Reading the bibliography…
We consider the problem of ranking $n$ players from partial pairwise comparison data under the Bradley-Terry-Luce model.
Iterative algorithm for discrete structure recovery, arXiv preprint arXiv:1911.01018
Gao, C. and Zhang, A. Y. [2019] · 1911
Earlier work this paper cites.
A law of comparative judgment., Psychological review
Thurstone, L. L. [1927] · 1927
Earlier work this paper cites.
Rank analysis of incomplete block designs: The method of paired comparisons, Biometrika
BRADLEY, R. A. and TERRY, M. E. [1952] · 1952
Earlier work this paper cites.
On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci
Erdős, P. and Rényi, A. [1960] · 1960
Earlier work this paper cites.
Conditional logit analysis of qualitative choice behavior
McFadden, D. [1973] · 1973
Earlier work this paper cites.
The analysis of permutations, Journal of the Royal Statistical Society: Series C (Applied Statistics)
Plackett, R. L. [1975] · 1975
Earlier work this paper cites.
Spearman’s footrule as a measure of disarray, Journal of the Royal Statistical Society: Series B (Methodological)
Diaconis, P. and Graham, R. L. [1977] · 1977
Earlier work this paper cites.
The choice axiom after twenty years, Journal of mathematical psychology
Luce, R. D. [1977] · 1977
Earlier work this paper cites.
The structure of random utility models, Theory and decision
Manski, C. F. [1977] · 1977
Earlier work this paper cites.
Implementing quicksort programs, Communications of the ACM
Sedgewick, R. [1978] · 1978
Earlier work this paper cites.
Decision making for leaders: the analytic hierarchy process for decisions in a complex world
Saaty, T. L. [1990] · 1990
Earlier work this paper cites.
A brief survey of bandwidth selection for density estimation, Journal of the American statistical association
Jones, M. C., Marron, J. S. and Sheather, S. J. [1996] · 1996
Earlier work this paper cites.
A meticulous analysis of mergesort programs, Italian Conference on Algorithms and Complexity
Katajainen, J. and Träff, J. L. [1997] · 1997
Earlier work this paper cites.
The art of computer programming
Knuth, D. E. [1997] · 1997
Earlier work this paper cites.
Stated choice methods: analysis and applications
Louviere, J. J., Hensher, D. A. and Swait, J. D. [2000] · 2000
Earlier work this paper cites.
Mixed mnl models for discrete response, Journal of applied Econometrics
McFadden, D. and Train, K. [2000] · 2000
Earlier work this paper cites.
Rank aggregation methods for the web, Proceedings of the 10th international conference on World Wide Web
Dwork, C., Kumar, R., Naor, M. and Sivakumar, D. [2001] · 2001
Earlier work this paper cites.
A common framework for deriving preference values from pairwise comparison matrices, Computers & operations research
Choo, E. U. and Wedley, W. C. [2004] · 2004
Earlier work this paper cites.
Mm algorithms for generalized bradley-terry models, The annals of statistics
Hunter, D. R. et al. [2004] · 2004
Cited alongside, same era.
Chen, P., Gao, C. and Zhang, A. Y. [2020] · 2006
Cited alongside, same era.
Subset ranking using regression, International Conference on Computational Learning Theory
Cossock, D. and Zhang, T. [2006] · 2006
Cited alongside, same era.
Estimation of skill distributions, arXiv preprint arXiv:2006.08189
Jadbabaie, A., Makur, A. and Shah, D. [2020] · 2006
Cited alongside, same era.
Learning to rank: from pairwise approach to listwise approach, Proceedings of the 24th international conference on Machine learning
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F. and Li, H. [2007] · 2007
An introduction to matrix concentration inequalities, Foundations and Trends® in Machine Learning
Tropp, J. A. [2015] · 2015
Later among the works it cites.
Minimax rates in permutation estimation for feature matching, The Journal of Machine Learning Research
Collier, O. and Dalalyan, A. S. [2016] · 2016
Later among the works it cites.
Jang, M., Kim, S., Suh, C. and Oh, S. [2016] · 2016
Later among the works it cites.
Linear regression with an unknown permutation: Statistical and computational limits, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Pananjady, A., Wainwright, M. J. and Courtade, T. A. [2016] · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Trueskill: a bayesian skill rating system, Advances in neural information processing systems
Herbrich, R., Minka, T. and Graepel, T. [2007] · 2007
Cited alongside, same era.
A second course in probability
Ross, S. M. and Peköz, E. A. [2007] · 2007
Cited alongside, same era.
Noisy sorting without resampling, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Braverman, M. and Mossel, E. [2008] · 2008
Cited alongside, same era.
Sorting from noisy information, arXiv preprint arXiv:0910.1191
Braverman, M. and Mossel, E. [2009] · 2009
Cited alongside, same era.
Group recommendations with rank aggregation and collaborative filtering, Proceedings of the fourth ACM conference on Recommender systems
Baltrunas, L., Makcinskas, T. and Ricci, F. [2010] · 2010
Cited alongside, same era.
Learning to rank for information retrieval
Liu, T.-Y. [2011] · 2011
Cited alongside, same era.
Individual choice behavior: A theoretical analysis
Luce, R. D. [2012] · 2012
Cited alongside, same era.
Sha, L., Lucey, P., Yue, Y., Carr, P., Rohlf, C. and Matthews, I. [2016] · 2016
Later among the works it cites.
Stochastically transitive models for pairwise comparisons: Statistical and computational issues, International Conference on Machine Learning
Shah, N., Balakrishnan, S., Guntuboyina, A. and Wainwright, M. [2016] · 2016
Later among the works it cites.
Competitive analysis of the top-k ranking problem, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Chen, X., Gopi, S., Mao, J. and Schneider, J. [2017] · 2017
Later among the works it cites.
Phase transitions in approximate ranking, arXiv preprint arXiv:1711.11189
Gao, C. [2017] · 2017
Later among the works it cites.
Optimal sample complexity of m-wise data for top-k ranking, Advances in Neural Information Processing Systems
Jang, M., Kim, S., Suh, C. and Oh, S. [2017] · 2017
Later among the works it cites.
Rank centrality: Ranking from pairwise comparisons, Operations Research
Negahban, S., Oh, S. and Shah, D. [2017] · 2017
Later among the works it cites.
Simple, robust and optimal ranking from pairwise comparisons, The Journal of Machine Learning Research
Shah, N. B. and Wainwright, M. J. [2017] · 2017
Later among the works it cites.
A computationally intensive ranking system for paired comparison data, Operations Research Perspectives
Beaudoin, D. and Swartz, T. [2018] · 2018
Later among the works it cites.
Attentive group recommendation, The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
Cao, D., He, X., Miao, L., An, Y., Yang, C. and Hong, R. [2018] · 2018
Later among the works it cites.
Minimax rates and efficient algorithms for noisy sorting, Algorithmic Learning Theory
Mao, C., Weed, J. and Rigollet, P. [2018] · 2018
Later among the works it cites.
Trueskill 2: An improved bayesian skill rating system
Minka, T., Cleven, R. and Zaykov, Y. [2018] · 2018
Later among the works it cites.
Spectral method and regularized mle are both optimal for top- k k ranking, The Annals of Statistics
Chen, Y., Fan, J., Ma, C. and Wang, K. [2019] · 2019
Later among the works it cites.
Worst-case versus average-case design for estimation from partial pairwise comparisons, Annals of Statistics
Pananjady, A., Mao, C., Muthukumar, V., Wainwright, M. J. and Courtade, T. A. [2020] · 2020
Later among the works it cites.