Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Spectral Ranking Inferences Based on General Multiway Comparisons

Published Online:17 Jul 2025https://doi.org/10.1287/opre.2023.0439

References

  • Aouad A, Farias V, Levi R, Segev D (2018) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
  • Avery CN, Glickman ME, Hoxby CM, Metrick A (2013) A revealed preference ranking of U.S. colleges and universities. Quart. J. Econom. 128(1):425–467.Crossref, Google Scholar
  • Azari Soufiani H, Chen W, Parkes DC, Xia L (2013) Generalized method-of-moments for rank aggregation. Burges CJ, Bottou L, Welling M, Ghahramani Z, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems (NIPS 2013), vol. 26 (MIT Press, Cambridge, MA), 2706–2714.Google Scholar
  • Baltrunas L, Makcinskas T, Ricci F (2010) Group recommendations with rank aggregation and collaborative filtering. Amatriain X, Torrens M, Resnick P, Zanker M, eds. RecSys ‘10 Proc. 4th ACM Conf. Recommender Systems (Association for Computing Machinery, New York), 119–126.Google Scholar
  • Bennett J, Lanning S (2007) The Netflix prize. Proc. KDD Cup Workshop (Association for Computing Machinery, New York).Google Scholar
  • Caron F, Teh YW, Murphy TB (2014) Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes. Ann. Appl. Statist. 8(2):1145–1181.Crossref, Google Scholar
  • Chen Y, Suh C (2015) Spectral MLE: Top-K rank aggregation from pairwise comparisons. Bach F, Blei D, eds. Proc. 32nd Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 37 (PMLR, New York), 371–380.Google Scholar
  • Chen P, Gao C, Zhang AY (2022) Partial recovery for top-k ranking: Optimality of MLE and suboptimality of the spectral method. Ann. Statist. 50(3):1618–1652.Crossref, Google Scholar
  • Chen X, Krishnamurthy A, Wang Y (2023) Robust dynamic assortment optimization in the presence of outlier customers. Oper. Res. 72(3):999–1015.Link, Google Scholar
  • Chen X, Wang Y, Zhou Y (2020) Dynamic assortment optimization with changing contextual information. J. Machine Learn. Res. 21(216):8918–8961.Google Scholar
  • Chen Y, Fan J, Ma C, Wang K (2019) Spectral method and regularized MLE are both optimal for top-K ranking. Ann. Statist. 47(4):2204–2235.Crossref, Google Scholar
  • Cheng W, Dembczynski K, Hüllermeier E (2010) Label ranking methods based on the Plackett-Luce model. Fürnkranz J, Joachims T, eds. Proc. 27th Internat. Conf. Machine Learn. (Omnipress, Madison, WI), 215–222.Google Scholar
  • Chernozhukov V, Chetverikov D, Kato K (2017) Central limit theorems and bootstrap in high dimensions. Ann. Probab. 45(4):2309–2352.Crossref, Google Scholar
  • Chernozhukov V, Chetverikov D, Kato K, Koike Y (2019) Improved central limit theorem and bootstrap approximations in high dimensions. Preprint, submitted December 22, https://arxiv.org/abs/1912.10529.Google Scholar
  • Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
  • Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. Shen V, Saito N, Lyu MR, Zurko ME, eds. Proc. 10th Internat. Conf. World Wide Web (Association for Computing Machinery, New York), 613–622.Google Scholar
  • Fan J, Hou J, Yu M (2022a) Uncertainty quantification of MLE for entity ranking with covariates. Preprint, submitted December 20, https://arxiv.org/abs/2212.09961.Google Scholar
  • Fan J, Lou Z, Wang W, Yu M (2022b) Ranking inferences based on the top choice of multiway comparisons. Preprint, submitted November 22, https://arxiv.org/abs/2211.11957.Google Scholar
  • Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
  • Gao C, Shen Y, Zhang AY (2021) Uncertainty quantification in the Bradley-Terry-Luce model. Preprint, submitted October 8, https://arxiv.org/abs/2110.03874.Google Scholar
  • Guiver J, Snelson E (2009) Bayesian inference for Plackett-Luce ranking models. Bottou L, Littman M, eds. Proc. 26th Annual Internat. Conf. Machine Learn. (Association for Computing Machinery, New York), 377–384.Google Scholar
  • Hajek B, Oh S, Xu J (2014) Minimax-optimal inference from partial rankings. Ghahramani Z, Welling M, Cortes C, Lawrence N, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems (NIPS 2014), vol. 27 (MIT Press, Cambridge, MA), 1475–1483.Google Scholar
  • Han R, Xu Y (2023) A unified analysis of likelihood-based estimators in the Plackett–Luce model. Preprint, submitted June 5, https://arxiv.org/abs/2306.02821.Google Scholar
  • Han R, Ye R, Tan C, Chen K (2020) Asymptotic theory of sparse Bradley-Terry model. Ann. Appl. Probab. 30(5):2491–2515.Crossref, Google Scholar
  • Hunter DR (2004) MM algorithms for generalized Bradley-Terry models. Ann. Statist. 32(1):384–406.Crossref, Google Scholar
  • Jang M, Kim S, Suh C (2018) Top-K rank aggregation from M-wise comparisons. IEEE J. Selected Topics Signal Processing 12(5):989–1004.Crossref, Google Scholar
  • Jang M, Kim S, Suh C, Oh S (2016) Top-K ranking from pairwise comparisons: When spectral ranking is optimal. Preprint, submitted March 14, https://arxiv.org/abs/1603.04153.Google Scholar
  • Ji P, Jin J, Ke ZT, Li W (2022) Co-citation and co-authorship networks of statisticians. J. Bus. Econom. Statist. 40(2):469–485.Crossref, Google Scholar
  • Ji P, Jin J, Ke ZT, Li W (2023) Meta-analysis on citations for statisticians. Working paper, University of Georgia, Athens.Google Scholar
  • Johnson VE, Deaner RO, Van Schaik CP (2002) Bayesian analysis of rank data with application to primate intelligence experiments. J. Amer. Statist. Assoc. 97(457):8–17.Crossref, Google Scholar
  • Li W, Shrotriya S, Rinaldo A (2022) ℓ∞-bounds of the MLE in the BTL model under general comparison graphs. Cussens J, Zhang K, eds. Proc. 38th Conf. Uncertainty Artificial Intelligence, Proceedings of Machine Learning Research, vol. 180 (PMLR, New York), 1178–1187.Google Scholar
  • Li H, Simchi-Levi D, Wu MX, Zhu W (2019) Estimating and exploiting the impact of photo layout: A structural approach. Preprint, submitted October 16, https://doi.org/10.2139/ssrn.3470877.Google Scholar
  • Liu Y, Fang EX, Lu J (2022) Lagrangian inference for ranking problems. Oper. Res. 71(1):202–223.Link, Google Scholar
  • Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis (John Wiley & Sons, Inc., New York).Google Scholar
  • Massey K (1997) Statistical models applied to the rating of sports teams. Undergraduate thesis, Bluefield College, Bluefield, VA.Google Scholar
  • Mattei N, Walsh T (2013) Preflib: A library for preferences http://www.preflib.org. Perny P, Pirlot M, Tsoukiàs A, eds. Algorithmic Decision Theory ADT 2013 (Springer, Berlin), 259–270.Google Scholar
  • Mattei N, Forshee J, Goldsmith J (2012) An empirical study of voting rules and manipulation with large datasets. Brandt F, Faliszewski P, eds. Workshop Notes 4th Internat. Workshop Comput. Soc. Choice COMSOC 2012 (Krakow, Poland), 299–310.Google Scholar
  • Maystre L, Grossglauser M (2015) Fast and accurate inference of Plackett-Luce models. Cortes C, Lawrence N, Lee D, Sugiyama M, Garnett R, eds. Adv. Neural Inform. Processing Systems (NIPS 2015), vol. 28 (MIT Press, Cambridge, MA), 172–180.Google Scholar
  • Negahban S, Oh S, Shah D (2012) Iterative ranking from pair-wise comparisons. Pereira F, Burges CK, Bottou L, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems (NIPS 2012), vol. 25 (MIT Press, Cambridge, MA), 2474–2482.Google Scholar
  • Ouyang L, Wu J, Jiang X, Almeida D, Wainwright C, Mishkin P, Zhang C, et al. (2022) Training language models to follow instructions with human feedback. Koyejo S, Mohamed S, Agarwal A, Belgrave D, Cho K, Oh A, eds. Adv. Neural Inform. Processing Systems (NeurIPS 2022), vol. 35 (MIT Press, Cambridge, MA), 27730–27744.Google Scholar
  • Plackett RL (1975) The analysis of permutations. J. Roy. Statist. Soc. Ser. C Appl. Statist. 24(2):193–202.Google Scholar
  • Portnoy S (1986) On the central limit theorem in Rp when p→∞. Probab. Theory Related Fields 73(4):571–583.Crossref, Google Scholar
  • Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4):865–882.Link, Google Scholar
  • Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
  • Shah N, Balakrishnan S, Bradley J, Parekh A, Ramchandran K, Wainwright M (2015) Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence. Lebanon G, Vishwanathan SVN, eds. Proc. 18th Internat. Conf. Artificial Intelligence Statist., Proceedings of Machine Learning Research, vol. 38 (PMLR, New York), 856–865.Google Scholar
  • Shen S, Chen X, Fang E, Lu J (2023) Combinatorial inference on the optimal assortment in multinomial logit models. Preprint, submitted February 27, https://doi.org/10.2139/ssrn.4371919.Google Scholar
  • Simons G, Yao Y-C (1999) Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons. Ann. Statist. 27(3):1041–1060.Crossref, Google Scholar
  • Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2020) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.Link, Google Scholar
  • Szörényi B, Busa-Fekete R, Paul A, Hüllermeier E (2015) Online rank elicitation for Plackett-Luce: A dueling bandits approach. Cortes C, Lawrence N, Lee D, Sugiyama M, Garnett R, eds. Adv. Neural Inform. Processing Systems (NIPS 2015), vol. 28 (MIT Press, Cambridge, MA), 604–612.Google Scholar
  • Talluri K, Van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
  • Turner H, Firth D (2012) Bradley-Terry models in R: The BradleyTerry2 package. J. Statist. Software 48(9):1–21.Crossref, Google Scholar
  • Vulcano G, Van Ryzin G, Ratliff R (2012) Estimating primary demand for substitutable products from sales transaction data. Oper. Res. 60(2):313–334.Link, Google Scholar
  • Wang X, Bendersky M, Metzler D, Najork M (2016) Learning to rank with selection bias in personal search. Raffaele P, Fabrizio S, eds. Proc. 39th Internat. ACM SIGIR Conf. Res. Development Inform. Retrieval (Association for Computing Machinery, New York), 115–124.Google Scholar
  • Zhang H, Rusmevichientong P, Topaloglu H (2020) Assortment optimization under the paired combinatorial logit model. Oper. Res. 68(3):741–761.Link, Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree