{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:15Z","timestamp":1750219815470,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"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":[[2023,9,14]]},"DOI":"10.1145\/3604915.3608824","type":"proceedings-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T22:40:23Z","timestamp":1694731223000},"page":"744-749","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Adversarial Sleeping Bandit Problems with Multiple Plays: Algorithm and Ranking Application"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9744-3443","authenticated-orcid":false,"given":"Jianjun","family":"Yuan","sequence":"first","affiliation":[{"name":"Machine Learning, Expedia Group, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6155-1741","authenticated-orcid":false,"given":"Wei Lee","family":"Woon","sequence":"additional","affiliation":[{"name":"Machine Learning, Expedia Group, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1905-7472","authenticated-orcid":false,"given":"Ludovik","family":"Coba","sequence":"additional","affiliation":[{"name":"Machine Learning, Expedia Group, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Recommender systems in industry: A netflix case study. Recommender systems handbook","author":"Amatriain Xavier","year":"2015","unstructured":"Xavier Amatriain and Justin Basilico. 2015. Recommender systems in industry: A netflix case study. Recommender systems handbook (2015), 385\u2013419."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796552"},{"key":"e_1_3_2_1_3_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning 47","author":"Auer Peter","year":"2002","unstructured":"Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning 47 (2002), 235\u2013256."},{"key":"e_1_3_2_1_4_1","series-title":"SIAM journal on computing 32, 1","volume-title":"The nonstochastic multiarmed bandit problem","author":"Auer Peter","year":"2002","unstructured":"Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert\u00a0E Schapire. 2002. The nonstochastic multiarmed bandit problem. SIAM journal on computing 32, 1 (2002), 48\u201377."},{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_1_5_1","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_6_1","unstructured":"Aritra Chatterjee Ganesh Ghalme Shweta Jain Rohit Vaish and Y Narahari. 2017. Analysis of Thompson Sampling for Stochastic Sleeping Bandits.. In UAI."},{"key":"e_1_3_2_1_7_1","volume-title":"International conference on machine learning. PMLR, 151\u2013159","author":"Chen Wei","year":"2013","unstructured":"Wei Chen, Yajun Wang, and Yang Yuan. 2013. Combinatorial multi-armed bandit: General framework and applications. In International conference on machine learning. PMLR, 151\u2013159."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474618"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753683726"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474247"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3568029"},{"key":"e_1_3_2_1_13_1","volume-title":"Hardness of online sleeping combinatorial optimization problems. Advances in Neural Information Processing Systems 29","author":"Kale Satyen","year":"2016","unstructured":"Satyen Kale, Chansoo Lee, and D\u00e1vid P\u00e1l. 2016. Hardness of online sleeping combinatorial optimization problems. Advances in Neural Information Processing Systems 29 (2016)."},{"key":"e_1_3_2_1_14_1","volume-title":"Non-stochastic bandit slate problems. Advances in Neural Information Processing Systems 23","author":"Kale Satyen","year":"2010","unstructured":"Satyen Kale, Lev Reyzin, and Robert\u00a0E Schapire. 2010. Non-stochastic bandit slate problems. Advances in Neural Information Processing Systems 23 (2010)."},{"key":"e_1_3_2_1_15_1","unstructured":"Varun Kanade H\u00a0Brendan McMahan and Brent Bryan. 2009. Sleeping experts and bandits with stochastic action availability and adversarial rewards. In Artificial Intelligence and Statistics. PMLR 272\u2013279."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505983"},{"key":"e_1_3_2_1_17_1","volume-title":"Regret bounds for sleeping experts and bandits. Machine learning 80, 2-3","author":"Kleinberg Robert","year":"2010","unstructured":"Robert Kleinberg, Alexandru Niculescu-Mizil, and Yogeshwer Sharma. 2010. Regret bounds for sleeping experts and bandits. Machine learning 80, 2-3 (2010), 245\u2013272."},{"key":"e_1_3_2_1_18_1","volume-title":"International Conference on Machine Learning. PMLR, 1152\u20131161","author":"Komiyama Junpei","year":"2015","unstructured":"Junpei Komiyama, Junya Honda, and Hiroshi Nakagawa. 2015. Optimal regret analysis of thompson sampling in stochastic multi-armed bandit problem with multiple plays. In International Conference on Machine Learning. PMLR, 1152\u20131161."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_20_1","volume-title":"Online combinatorial optimization with stochastic decision sets and adversarial losses. Advances in Neural Information Processing Systems 27","author":"Neu Gergely","year":"2014","unstructured":"Gergely Neu and Michal Valko. 2014. Online combinatorial optimization with stochastic decision sets and adversarial losses. Advances in Neural Information Processing Systems 27 (2014)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454047"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-0716-2197-4_1"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 8357\u20138366","author":"Saha Aadirupa","year":"2020","unstructured":"Aadirupa Saha, Pierre Gaillard, and Michal Valko. 2020. Improved sleeping bandits with stochastic action sets and adversarial rewards. In International Conference on Machine Learning. PMLR, 8357\u20138366."},{"key":"e_1_3_2_1_24_1","volume-title":"Two decades of recommender systems at Amazon.com","author":"Smith Brent","year":"2017","unstructured":"Brent Smith and Greg Linden. 2017. Two decades of recommender systems at Amazon.com. IEEE Internet Computing (2017). https:\/\/www.amazon.science\/publications\/two-decades-of-recommender-systems-at-amazon-com"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_30"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_42"},{"key":"e_1_3_2_1_27_1","first-page":"2287","article-title":"Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension","author":"Warmuth K","year":"2008","unstructured":"Manfred\u00a0K Warmuth and Dima Kuzmin. 2008. Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research 9, Oct (2008), 2287\u20132320.","journal-title":"Journal of Machine Learning Research 9"},{"key":"e_1_3_2_1_28_1","unstructured":"Yingce Xia Tao Qin Weidong Ma Nenghai Yu and Tie-Yan Liu. 2016. Budgeted Multi-Armed Bandits with Multiple Plays.. In IJCAI Vol.\u00a06. 2210\u20132216."}],"event":{"name":"RecSys '23: Seventeenth ACM Conference on Recommender Systems","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval","SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGecom Special Interest Group on Economics and Computation"],"location":"Singapore Singapore","acronym":"RecSys '23"},"container-title":["Proceedings of the 17th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604915.3608824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604915.3608824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:07Z","timestamp":1750178767000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604915.3608824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,14]]},"references-count":28,"alternative-id":["10.1145\/3604915.3608824","10.1145\/3604915"],"URL":"https:\/\/doi.org\/10.1145\/3604915.3608824","relation":{},"subject":[],"published":{"date-parts":[[2023,9,14]]},"assertion":[{"value":"2023-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}