{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T09:03:46Z","timestamp":1779699826066,"version":"3.53.1"},"reference-count":59,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>The Price of Attention: Ranking Products for Maximum Revenue<\/jats:p>\n                  <jats:p>How should an online retailer rank products when customers have limited attention spans? Chen, Li, and Yang tackle this classic problem by extending the well-known cascade model to account for two crucial, real-world factors: customers view only a random number of items, and the firm\u2019s goal is to maximize revenue, not just clicks. This creates a difficult trade-off between ranking popular, low-price items and riskier, high-price ones. The authors propose the \u201cBest-x\u201d algorithm, an efficient method for finding a near-optimal ranking. They prove it guarantees a revenue of at least 1\/e (approximately 37%) of that achievable by a clairvoyant who knows each customer\u2019s attention span in advance. For cases where product attractiveness and attention distributions are unknown, the authors also devise the RankUCB online learning algorithm, which learns personalized rankings from customer interactions and achieves near-optimal performance over time.<\/jats:p>","DOI":"10.1287\/opre.2020.0781","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T16:14:50Z","timestamp":1767629690000},"page":"1284-1303","source":"Crossref","is-referenced-by-count":0,"title":["Revenue Maximization and Learning in Product Ranking"],"prefix":"10.1287","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3948-1011","authenticated-orcid":false,"given":"Ningyuan","family":"Chen","sequence":"first","affiliation":[{"name":"Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7001-2240","authenticated-orcid":false,"given":"Anran","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Decisions, Operations and Technology, The Chinese University of Hong Kong, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0915-196X","authenticated-orcid":false,"given":"Shuoguang","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-015-0302-y"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1509\/jmr.08.0468"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1832"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3664"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.00281"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0725"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2370"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1111\/j.1530-9134.2009.00234.x"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1103"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1057"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.0371"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013264"},{"key":"B17","unstructured":"Cao J, Sun W, Shen Z-JM (2019) Doubly adaptive cascading bandits with user abandonment. Working paper, University of Texas, Austin."},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1257\/aer.101.7.2899"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2016"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1220"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2018.0937"},{"issue":"216","key":"B22","first-page":"1","volume":"21","author":"Chen X","year":"2020","journal-title":"J. Machine Learn. Res."},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.01299"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1629"},{"key":"B25","unstructured":"Cheung WC, Tan V, Zhong Z (2019) A Thompson sampling algorithm for cascading bandits. Chaudhuri K, Sugiyama M, eds.\n                      Proc. 22nd Internat. Conf. Artificial Intelligence Statist.\n                      (PMLR, New York), 438\u2013447."},{"key":"B26","doi-asserted-by":"crossref","unstructured":"Craswell N, Zoeter O, Taylor M, Ramsey B (2008) An experimental comparison of click position-bias models.\n                      Proc. 2008 Internat. Conf. Web Search Data Mining\n                      (Association for Computing Machinery, New York), 87\u201394.","DOI":"10.1145\/1341531.1341545"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2015.03.001"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4044"},{"key":"B29","doi-asserted-by":"crossref","unstructured":"Feldman J, Segev D (2019) Improved approximation schemes for MNL-driven sequential assortment optimization. Working paper, Washington University, St. Louis.","DOI":"10.2139\/ssrn.3440645"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0135"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4130"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1755"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.08.047"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.0333"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1875"},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4246"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2127"},{"key":"B8","doi-asserted-by":"crossref","unstructured":"Gah-Yi B, Bora KN (2021) Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity.\n                      Management Sci.\n                      67(9):5549\u20135568.","DOI":"10.1287\/mnsc.2020.3680"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1090.1054"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2380"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1948"},{"key":"B41","unstructured":"Katariya S, Kveton B, Szepesvari C, Wen Z (2016) DCM bandits: Learning to rank with multiple clicks. Balcan MF, Weinberger KQ, eds.\n                      Proc. 33rd Internat. Conf. Machine Learn.\n                      (PMLR, New York), 1215\u20131224."},{"key":"B42","doi-asserted-by":"crossref","unstructured":"Kempe D, Mahdian M (2008) A cascade model for externalities in sponsored search. Papadimitriou C, Zhang S, eds.\n                      Internet Network Econom. WINE 2008\n                      (Springer, Berlin), 585\u2013596.","DOI":"10.1007\/978-3-540-92185-1_65"},{"key":"B43","unstructured":"Kveton B, Szepesvari C, Wen Z, Ashkan A (2015a) Cascading bandits: Learning to rank in the cascade model. Bach F, Blei D, eds.\n                      Proc. 32nd Internat. Conf. Machine Learn.\n                      , vol. 37 (PMLR, New York), 767\u2013776."},{"key":"B44","unstructured":"Kveton B, Wen Z, Ashkan A, Szepesvari C (2015b) Combinatorial cascading bandits. Cortes C, Lawrence N, Lee D, Sugiyama M, Garnett R, eds.\n                      Advances in Neural Information Processing Systems\n                      , vol. 28 (NIPS 2015) (Curran Associates Inc., Red Hook, NY), 1450\u20131458."},{"key":"B45","unstructured":"Lagr\u00e9e P, Vernade C, Cappe O (2016) Multiple-play bandits in the position-based model. Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R, eds.\n                      Advances in Neural Information Processing Systems\n                      , vol. 29 (NIPS 2016) (Curran Associates Inc., Red Hook, NY), 1597\u20131605."},{"key":"B46","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0910"},{"key":"B47","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.3.334.11210"},{"key":"B48","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13783"},{"key":"B49","doi-asserted-by":"crossref","unstructured":"Niazadeh R, Golrezaei N, Wang JR, Susan F, Badanidiyuru A (2021) Online learning via offline greedy algorithms: Applications in market design and optimization.\n                      Proc. 22nd ACM Conf. Econom. Comput.\n                      (Association for Computing Machinery, New York), 737\u2013738.","DOI":"10.1145\/3465456.3467571"},{"key":"B50","unstructured":"Oh M-H, Iyengar G (2019) Thompson sampling for multinomial logit contextual bandits. Wallach H, Larochelle H, Beygelzimer A, d\u2019Alch\u00e9-Buc F, Fox E, Garnett R, eds.\n                      Advances in Neural Information Processing Systems\n                      , vol. 32 (Curran Associates Inc., Red Hook, NY), 3151\u20133161."},{"key":"B51","volume-title":"The Hazard Rate: Theory and Inference (with Supplementary MATLAB-Programs)","author":"Rinne H","year":"2014"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0866"},{"key":"B53","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2013.0429"},{"key":"B54","doi-asserted-by":"publisher","DOI":"10.2307\/1884852"},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1030.0147"},{"key":"B56","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2017.2790"},{"key":"B57","unstructured":"Zhang Z, Ahn H-S, Baardman L (2024) Inventory Ordering and Product Ranking for Online Curation Retailers. Working paper, Boston College, Chestnut Hill, MA."},{"key":"B58","unstructured":"Zoghi M, Tunys T, Ghavamzadeh M, Kveton B, Szepesvari C, Wen Z (2017) Online learning to rank in stochastic click models. Precup D, Teh YW, eds.\n                      Proc. 34th Internat. Conf. Machine Learn.\n                      (PMLR, New York), 4199\u20134208."},{"key":"B59","unstructured":"Zong S, Ni H, Sung K, Ke NR, Wen Z, Kveton B (2016) Cascading bandits for large-scale recommendation problems. Ihler A, Janzing D, eds.\n                      UAI\u201916 Proc. 32nd Conf. Uncertainty Artificial Intelligence\n                      (AUAI Press, Arlington, VA), 835\u2013844."}],"container-title":["Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/opre.2020.0781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T08:14:52Z","timestamp":1779696892000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/opre.2020.0781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1287\/opre.2020.0781"],"URL":"https:\/\/doi.org\/10.1287\/opre.2020.0781","relation":{},"ISSN":["0030-364X","1526-5463"],"issn-type":[{"value":"0030-364X","type":"print"},{"value":"1526-5463","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}