{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:00:30Z","timestamp":1772906430587,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412723","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:18:51Z","timestamp":1603088331000},"page":"2405-2412","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning to Rank in the Position Based Model with Bandit Feedback"],"prefix":"10.1145","author":[{"given":"Beyza","family":"Ermis","sequence":"first","affiliation":[{"name":"Amazon, Berlin, Germany"}]},{"given":"Patrick","family":"Ernst","sequence":"additional","affiliation":[{"name":"Amazon, Berlin, Germany"}]},{"given":"Yannik","family":"Stein","sequence":"additional","affiliation":[{"name":"Amazon, Berlin, Germany"}]},{"given":"Giovanni","family":"Zappella","sequence":"additional","affiliation":[{"name":"Amazon, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2312","volume-title":"Advances in Neural Information Processing Systems","author":"Abbasi-Yadkori Yasin","year":"2011","unstructured":"Yasin Abbasi-Yadkori , D\u00e1vid P\u00e1l , and Csaba Szepesv\u00e1ri . Improved algorithms for linear stochastic bandits . In Advances in Neural Information Processing Systems , pages 2312 -- 2320 , 2011 . Yasin Abbasi-Yadkori, D\u00e1vid P\u00e1l, and Csaba Szepesv\u00e1ri. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems, pages 2312--2320, 2011."},{"key":"e_1_3_2_1_2_1","first-page":"127","volume-title":"ICML '13","author":"Agrawal Shipra","year":"2013","unstructured":"Shipra Agrawal and Navin Goyal . Thompson sampling for contextual bandits with linear payoffs . In ICML '13 , pages 127 -- 135 , 2013 . Shipra Agrawal and Navin Goyal. Thompson sampling for contextual bandits with linear payoffs. In ICML '13, pages 127--135, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"e_1_3_2_1_4_1","first-page":"208","volume-title":"Proceedings of the 14. International Conference on Artificial Intelligence and Statistics","author":"Chu Wei","year":"2011","unstructured":"Wei Chu , Lihong Li , Lev Reyzin , and Robert Schapire . Contextual bandits with linear payoff functions . In Proceedings of the 14. International Conference on Artificial Intelligence and Statistics , pages 208 -- 214 , 2011 . Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire. Contextual bandits with linear payoff functions. In Proceedings of the 14. International Conference on Artificial Intelligence and Statistics, pages 208--214, 2011."},{"key":"e_1_3_2_1_5_1","volume-title":"Click models for web search. Synthesis Lectures on Information Concepts, Retrieval, and Services, 7(3):1--115","author":"Chuklin Aleksandr","year":"2015","unstructured":"Aleksandr Chuklin , Ilya Markov , and Maarten de Rijke . Click models for web search. Synthesis Lectures on Information Concepts, Retrieval, and Services, 7(3):1--115 , 2015 . Aleksandr Chuklin, Ilya Markov, and Maarten de Rijke. Click models for web search. Synthesis Lectures on Information Concepts, Retrieval, and Services, 7(3):1--115, 2015."},{"key":"e_1_3_2_1_6_1","first-page":"2116","volume-title":"Advances in Neural Information Processing Systems","author":"Combes Richard","year":"2015","unstructured":"Richard Combes , Mohammad Sadegh Talebi Mazraeh Shahi , Alexandre Proutiere , Combinatorial bandits revisited . In Advances in Neural Information Processing Systems , pages 2116 -- 2124 , 2015 . Richard Combes, Mohammad Sadegh Talebi Mazraeh Shahi, Alexandre Proutiere, et al. Combinatorial bandits revisited. In Advances in Neural Information Processing Systems, pages 2116--2124, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313592"},{"key":"e_1_3_2_1_9_1","first-page":"169","volume-title":"Efficient optimal learning for contextual bandits. UAI '11","author":"Dudik Miroslav","year":"2011","unstructured":"Miroslav Dudik , Daniel Hsu , Satyen Kale , Nikos Karampatziakis , John Langford , Lev Reyzin , and Tong Zhang . Efficient optimal learning for contextual bandits. UAI '11 , pages 169 -- 178 , Arlington, Virginia, United States, 2011 . AUAI Press . Miroslav Dudik, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang. Efficient optimal learning for contextual bandits. UAI '11, pages 169--178, Arlington, Virginia, United States, 2011. AUAI Press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109897"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3305381.3305511"},{"key":"e_1_3_2_1_12_1","first-page":"757","volume-title":"International Conference on Machine Learning","author":"Gentile Claudio","year":"2014","unstructured":"Claudio Gentile , Shuai Li , and Giovanni Zappella . Online clustering of bandits . In International Conference on Machine Learning , pages 757 -- 765 , 2014 . Claudio Gentile, Shuai Li, and Giovanni Zappella. Online clustering of bandits. In International Conference on Machine Learning, pages 757--765, 2014."},{"key":"e_1_3_2_1_13_1","volume-title":"ICML '10","author":"Graepel Thore","year":"2010","unstructured":"Thore Graepel , Joaquin Quinonero Candela , Thomas Borchert , and Ralf Herbrich . Web-scale bayesian click-through rate prediction for sponsored search advertising in Microsoft's bing search engine . In ICML '10 , 2010 . Thore Graepel, Joaquin Quinonero Candela, Thomas Borchert, and Ralf Herbrich. Web-scale bayesian click-through rate prediction for sponsored search advertising in Microsoft's bing search engine. In ICML '10, 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291027"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_1_16_1","first-page":"4998","volume-title":"Advances in Neural Information Processing Systems","author":"Komiyama Junpei","year":"2017","unstructured":"Junpei Komiyama , Junya Honda , and Akiko Takeda . Position-based multiple-play bandit problem with unknown position bias . In Advances in Neural Information Processing Systems , pages 4998 -- 5008 , 2017 . Junpei Komiyama, Junya Honda, and Akiko Takeda. Position-based multiple-play bandit problem with unknown position bias. In Advances in Neural Information Processing Systems, pages 4998--5008, 2017."},{"key":"e_1_3_2_1_17_1","first-page":"767","volume-title":"ICML'15","author":"Kveton Branislav","year":"2015","unstructured":"Branislav Kveton , Csaba Szepesv\u00e1ri , Zheng Wen , and Azin Ashkan . Cascading bandits : Learning to rank in the cascade model . In ICML'15 , pages 767 -- 776 , 2015 . Branislav Kveton, Csaba Szepesv\u00e1ri, Zheng Wen, and Azin Ashkan. Cascading bandits: Learning to rank in the cascade model. In ICML'15, pages 767--776, 2015."},{"key":"e_1_3_2_1_18_1","first-page":"1597","volume-title":"Advances in Neural Information Processing Systems 29","author":"Lagr\u00e9e Paul","year":"2016","unstructured":"Paul Lagr\u00e9e , Claire Vernade , and Olivier Cappe . Multiple-play bandits in the position-based model. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, editors , Advances in Neural Information Processing Systems 29 , pages 1597 -- 1605 . Curran Associates, Inc. , 2016 . Paul Lagr\u00e9e, Claire Vernade, and Olivier Cappe. Multiple-play bandits in the position-based model. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, editors, Advances in Neural Information Processing Systems 29, pages 1597--1605. Curran Associates, Inc., 2016."},{"key":"e_1_3_2_1_19_1","volume-title":"NeurIPS","author":"Lattimore Tor","year":"2018","unstructured":"Tor Lattimore , Branislav Kveton , Shuai Li , and Csaba Szepesv\u00e1ri . Toprank : A practical algorithm for online stochastic ranking . In NeurIPS , 2018 . Tor Lattimore, Branislav Kveton, Shuai Li, and Csaba Szepesv\u00e1ri. Toprank: A practical algorithm for online stochastic ranking. In NeurIPS, 2018."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220028"},{"key":"e_1_3_2_1_21_1","volume-title":"Asymptotically optimal algorithms for budgeted multiple play bandits. Preprint (https:\/\/hal.archives-ouvertes.fr\/hal-01338733)","author":"Luedtke Alexander R.","year":"2017","unstructured":"Alexander R. Luedtke , Emilie Kaufmann , and Antoine Chambaz . Asymptotically optimal algorithms for budgeted multiple play bandits. Preprint (https:\/\/hal.archives-ouvertes.fr\/hal-01338733) , 2017 . Alexander R. Luedtke, Emilie Kaufmann, and Antoine Chambaz. Asymptotically optimal algorithms for budgeted multiple play bandits. Preprint (https:\/\/hal.archives-ouvertes.fr\/hal-01338733), 2017."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729893"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1145\/2818346","volume-title":"ICML '15","author":"Wen Zheng","year":"2015","unstructured":"Zheng Wen , Branislav Kveton , and Azin Ashkan . Efficient learning in large-scale combinatorial semi-bandits . In ICML '15 , pages 1113 -- 1122 , 2015 . Zheng Wen, Branislav Kveton, and Azin Ashkan. Efficient learning in large-scale combinatorial semi-bandits. In ICML '15, pages 1113--1122, 2015."},{"key":"e_1_3_2_1_27_1","first-page":"835","volume-title":"Zheng Wen, and Branislav Kveton. Cascading bandits for large-scale recommendation problems. UAI '16","author":"Zong Shi","year":"2016","unstructured":"Shi Zong , Hao Ni , Kenny Sung , Nan Rosemary Ke , Zheng Wen, and Branislav Kveton. Cascading bandits for large-scale recommendation problems. UAI '16 , pages 835 -- 844 , Arlington, Virginia, United States, 2016 . AUAI Press . Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, and Branislav Kveton. Cascading bandits for large-scale recommendation problems. UAI '16, pages 835--844, Arlington, Virginia, United States, 2016. AUAI Press."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412723","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:55Z","timestamp":1750197775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":27,"alternative-id":["10.1145\/3340531.3412723","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412723","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}