{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:32:28Z","timestamp":1770345148306,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380115","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"292-302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Hierarchical Adaptive Contextual Bandits for Resource Constraint based Recommendation"],"prefix":"10.1145","author":[{"given":"Mengyue","family":"Yang","sequence":"first","affiliation":[{"name":"University of Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyang","family":"Li","sequence":"additional","affiliation":[{"name":"Didi Research America, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Qin","sequence":"additional","affiliation":[{"name":"Didi Research America, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Didi Chuxing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312\u20132320.  Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312\u20132320."},{"key":"e_1_3_2_1_2_1","unstructured":"Shipra Agrawal and Nikhil Devanur. 2016. Linear contextual bandits with knapsacks. In Advances in Neural Information Processing Systems. 3450\u20133458.  Shipra Agrawal and Nikhil Devanur. 2016. Linear contextual bandits with knapsacks. In Advances in Neural Information Processing Systems. 3450\u20133458."},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Machine Learning. 127\u2013135","author":"Agrawal Shipra","year":"2013","unstructured":"Shipra Agrawal and Navin Goyal . 2013 . Thompson sampling for contextual bandits with linear payoffs . In International Conference on Machine Learning. 127\u2013135 . Shipra Agrawal and Navin Goyal. 2013. Thompson sampling for contextual bandits with linear payoffs. In International Conference on Machine Learning. 127\u2013135."},{"key":"e_1_3_2_1_4_1","volume-title":"Nov","author":"Auer Peter","year":"2002","unstructured":"Peter Auer . 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research 3 , Nov ( 2002 ), 397\u2013422. Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research 3, Nov (2002), 397\u2013422."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_1_6_1","volume-title":"Conference on Learning Theory. 1109\u20131134","author":"Badanidiyuru Ashwinkumar","year":"2014","unstructured":"Ashwinkumar Badanidiyuru , John Langford , and Aleksandrs Slivkins . 2014 . Resourceful contextual bandits . In Conference on Learning Theory. 1109\u20131134 . Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins. 2014. Resourceful contextual bandits. In Conference on Learning Theory. 1109\u20131134."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Avinash Balakrishnan Djallel Bouneffouf Nicholas Mattei and Francesca Rossi. 2018. Using Contextual Bandits with Behavioral Constraints for Constrained Online Movie Recommendation.. In IJCAI. 5802\u20135804.  Avinash Balakrishnan Djallel Bouneffouf Nicholas Mattei and Francesca Rossi. 2018. Using Contextual Bandits with Behavioral Constraints for Constrained Online Movie Recommendation.. In IJCAI. 5802\u20135804.","DOI":"10.24963\/ijcai.2018\/843"},{"key":"e_1_3_2_1_8_1","unstructured":"Deepayan Chakrabarti Ravi Kumar Filip Radlinski and Eli Upfal. 2009. Mortal multi-armed bandits. In Advances in neural information processing systems. 273\u2013280.  Deepayan Chakrabarti Ravi Kumar Filip Radlinski and Eli Upfal. 2009. Mortal multi-armed bandits. In Advances in neural information processing systems. 273\u2013280."},{"key":"e_1_3_2_1_9_1","unstructured":"Ku-Chun Chou Hsuan-Tien Lin Chao-Kai Chiang and Chi-Jen Lu. 2014. Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions.. In ACML.  Ku-Chun Chou Hsuan-Tien Lin Chao-Kai Chiang and Chi-Jen Lu. 2014. Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions.. In ACML."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013445"},{"key":"e_1_3_2_1_11_1","unstructured":"Sarah Filippi Olivier Cappe Aur\u00e9lien Garivier and Csaba Szepesv\u00e1ri. 2010. Parametric bandits: The generalized linear case. In Advances in Neural Information Processing Systems. 586\u2013594.  Sarah Filippi Olivier Cappe Aur\u00e9lien Garivier and Csaba Szepesv\u00e1ri. 2010. Parametric bandits: The generalized linear case. In Advances in Neural Information Processing Systems. 586\u2013594."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121108"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346956"},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Machine Learning. 100\u2013108","author":"Gopalan Aditya","year":"2014","unstructured":"Aditya Gopalan , Shie Mannor , and Yishay Mansour . 2014 . Thompson sampling for complex online problems . In International Conference on Machine Learning. 100\u2013108 . Aditya Gopalan, Shie Mannor, and Yishay Mansour. 2014. Thompson sampling for complex online problems. In International Conference on Machine Learning. 100\u2013108."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760730"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Sumeet Katariya Branislav Kveton Csaba Szepesv\u00e1ri Claire Vernade and Zheng Wen. 2017. Bernoulli Rank-1 Bandits for Click Feedback. arXiv preprint arXiv:1703.06513(2017).  Sumeet Katariya Branislav Kveton Csaba Szepesv\u00e1ri Claire Vernade and Zheng Wen. 2017. Bernoulli Rank-1 Bandits for Click Feedback. arXiv preprint arXiv:1703.06513(2017).","DOI":"10.24963\/ijcai.2017\/278"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981562.2981665"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939859"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240408"},{"key":"e_1_3_2_1_21_1","unstructured":"Mehryar Mohri and Andres Munoz. 2014. Optimal regret minimization in posted-price auctions with strategic buyers. In Advances in Neural Information Processing Systems. 1871\u20131879.  Mehryar Mohri and Andres Munoz. 2014. Optimal regret minimization in posted-price auctions with strategic buyers. In Advances in Neural Information Processing Systems. 1871\u20131879."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.20"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347019"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330933"},{"key":"e_1_3_2_1_25_1","unstructured":"Aleksandrs Slivkins. 2013. Dynamic ad allocation: Bandits with budgets. arXiv preprint arXiv:1306.0155(2013).  Aleksandrs Slivkins. 2013. Dynamic ad allocation: Bandits with budgets. arXiv preprint arXiv:1306.0155(2013)."},{"key":"e_1_3_2_1_26_1","unstructured":"Huasen Wu Rayadurgam Srikant Xin Liu and Chong Jiang. 2015. Algorithms with logarithmic or sublinear regret for constrained contextual bandits. In Advances in Neural Information Processing Systems. 433\u2013441.  Huasen Wu Rayadurgam Srikant Xin Liu and Chong Jiang. 2015. Algorithms with logarithmic or sublinear regret for constrained contextual bandits. In Advances in Neural Information Processing Systems. 433\u2013441."},{"key":"e_1_3_2_1_27_1","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence.","author":"Xia Yingce","year":"2015","unstructured":"Yingce Xia , Haifang Li , Tao Qin , Nenghai Yu , and Tie-Yan Liu . 2015 . Thompson sampling for budgeted multi-armed bandits . In Twenty-Fourth International Joint Conference on Artificial Intelligence. Yingce Xia, Haifang Li, Tao Qin, Nenghai Yu, and Tie-Yan Liu. 2015. Thompson sampling for budgeted multi-armed bandits. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"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. 2210\u20132216.  Yingce Xia Tao Qin Weidong Ma Nenghai Yu and Tie-Yan Liu. 2016. Budgeted Multi-Armed Bandits with Multiple Plays.. In IJCAI. 2210\u20132216."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71249-9_30"},{"key":"e_1_3_2_1_30_1","unstructured":"Yisong Yue Sue\u00a0Ann Hong and Carlos Guestrin. 2012. Hierarchical exploration for accelerating contextual bandits. arXiv preprint arXiv:1206.6454(2012).  Yisong Yue Sue\u00a0Ann Hong and Carlos Guestrin. 2012. Hierarchical exploration for accelerating contextual bandits. arXiv preprint arXiv:1206.6454(2012)."},{"key":"e_1_3_2_1_31_1","unstructured":"Li Zhou and Emma Brunskill. 2016. Latent contextual bandits and their application to personalized recommendations for new users. arXiv preprint arXiv:1604.06743(2016).  Li Zhou and Emma Brunskill. 2016. Latent contextual bandits and their application to personalized recommendations for new users. arXiv preprint arXiv:1604.06743(2016)."}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:59Z","timestamp":1750199579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":31,"alternative-id":["10.1145\/3366423.3380115","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380115","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}