{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:40:10Z","timestamp":1782834010521,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100004829","name":"Department of Science and Technology of Sichuan Province","doi-asserted-by":"publisher","award":["2023YFS0317"],"award-info":[{"award-number":["2023YFS0317"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100004829","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2024M752282"],"award-info":[{"award-number":["2024M752282"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72371176"],"award-info":[{"award-number":["72371176"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3680107","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:21Z","timestamp":1729452861000},"page":"4506-4513","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Bayesian Multi-Armed Bandit Algorithm for Bid Shading in Online Display Advertising"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3559-733X","authenticated-orcid":false,"given":"Mengzhuo","family":"Guo","sequence":"first","affiliation":[{"name":"Sichuan University, Chengdu, Sichuan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4236-1827","authenticated-orcid":false,"given":"Wuqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-3342","authenticated-orcid":false,"given":"Congde","family":"Yuan","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6820-2846","authenticated-orcid":false,"given":"Binfeng","family":"Jia","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8823-3540","authenticated-orcid":false,"given":"Guoqing","family":"Song","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4942-5395","authenticated-orcid":false,"given":"Hua","family":"Hua","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6180-8607","authenticated-orcid":false,"given":"Shuangyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6819-0686","authenticated-orcid":false,"given":"Qingpeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Conference on learning theory. JMLR Workshop and Conference Proceedings, 39--1.","author":"Agrawal Shipra","year":"2012","unstructured":"Shipra Agrawal and Navin Goyal. 2012. Analysis of thompson sampling for the multi-armed bandit problem. In Conference on learning theory. JMLR Workshop and Conference Proceedings, 39--1."},{"key":"e_1_3_2_1_2_1","volume-title":"Existence of an equilibrium for a competitive economy. Econometrica: Journal of the Econometric Society","author":"Arrow Kenneth J","year":"1954","unstructured":"Kenneth J Arrow and Gerard Debreu. 1954. Existence of an equilibrium for a competitive economy. Econometrica: Journal of the Econometric Society (1954), 265--290."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953023"},{"key":"e_1_3_2_1_4_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning","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, Vol. 47, 2 (2002), 235--256."},{"key":"e_1_3_2_1_5_1","first-page":"1713","article-title":"Unreasonable effectiveness of greedy algorithms in multi-armed bandit with many arms","volume":"33","author":"Bayati Mohsen","year":"2020","unstructured":"Mohsen Bayati, Nima Hamidi, Ramesh Johari, and Khashayar Khosravi. 2020. Unreasonable effectiveness of greedy algorithms in multi-armed bandit with many arms. Advances in Neural Information Processing Systems, Vol. 33 (2020), 1713--1723.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on Machine Learning. PMLR, 1587--1595","author":"Degenne R\u00e9my","year":"2016","unstructured":"R\u00e9my Degenne and Vianney Perchet. 2016. Anytime optimal algorithms in stochastic multi-armed bandits. In International Conference on Machine Learning. PMLR, 1587--1595."},{"key":"e_1_3_2_1_8_1","first-page":"1939","article-title":"Online multi-armed bandits with adaptive inference","volume":"34","author":"Dimakopoulou Maria","year":"2021","unstructured":"Maria Dimakopoulou, Zhimei Ren, and Zhengyuan Zhou. 2021. Online multi-armed bandits with adaptive inference. Advances in Neural Information Processing Systems, Vol. 34 (2021), 1939--1951.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891493"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412689"},{"key":"e_1_3_2_1_11_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Guo Xin","year":"2019","unstructured":"Xin Guo, Anran Hu, Renyuan Xu, and Junzi Zhang. 2019. Learning mean-field games. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_12_1","volume-title":"Optimal no-regret learning in repeated first-price auctions. arXiv preprint arXiv:2003.09795","author":"Han Yanjun","year":"2020","unstructured":"Yanjun Han, Zhengyuan Zhou, and Tsachy Weissman. 2020. Optimal no-regret learning in repeated first-price auctions. arXiv preprint arXiv:2003.09795 (2020)."},{"key":"e_1_3_2_1_13_1","volume-title":"Online advertisements and multi-armed bandits","author":"Jiang Chong","unstructured":"Chong Jiang. 2015. Online advertisements and multi-armed bandits. University of Illinois at Urbana-Champaign."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9482665"},{"key":"e_1_3_2_1_15_1","unstructured":"Emilie Kaufmann Olivier Capp\u00e9 and Aur\u00e9lien Garivier. 2012. On Bayesian upper confidence bounds for bandit problems. In Artificial intelligence and statistics. PMLR 592--600."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539048"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Weichao Mao Zhenzhe Zheng Fan Wu and Guihai Chen. 2018. Online pricing for revenue maximization with unknown time discounting valuations. In IJCAI. 440--446.","DOI":"10.24963\/ijcai.2018\/61"},{"key":"e_1_3_2_1_18_1","unstructured":"Shengjun Pan Brendan Kitts Tian Zhou Hao He Bharatbhushan Shetty Aaron Flores Djordje Gligorijevic Junwei Pan Tingyu Mao San Gultekin et al. 2020. Bid shading by win-rate estimation and surplus maximization. arXiv preprint arXiv:2009.09259 (2020)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330870"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1199"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.2017.1083"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.2016.1023"},{"key":"e_1_3_2_1_23_1","volume-title":"Foundations and Trends\u00ae in Machine Learning","volume":"12","author":"Aleksandrs","year":"2019","unstructured":"Aleksandrs Slivkins et al. 2019. Introduction to multi-armed bandits. Foundations and Trends\u00ae in Machine Learning, Vol. 12, 1--2 (2019), 1--286."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-2070(00)00065-0"},{"key":"e_1_3_2_1_25_1","volume-title":"Multi-armed bandits for bid shading in first-price real-time bidding auctions. Journal of Intelligent & Fuzzy Systems Preprint","author":"Tilli Tuomo","year":"2021","unstructured":"Tuomo Tilli and Leonardo Espinosa-Leal. 2021. Multi-armed bandits for bid shading in first-price real-time bidding auctions. Journal of Intelligent & Fuzzy Systems Preprint (2021), 1--15."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220066"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1305--1314","author":"Chi-Hsuan Wu Wush","year":"2015","unstructured":"Wush Chi-Hsuan Wu, Mi-Yen Yeh, and Ming-Syan Chen. 2015. Predicting winning price in real time bidding with censored data. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1305--1314."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557064"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467113"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467167"}],"event":{"name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","location":"Boise ID USA","acronym":"CIKM '24","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3680107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3680107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:18Z","timestamp":1750294698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3680107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":30,"alternative-id":["10.1145\/3627673.3680107","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3680107","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}