{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:09:36Z","timestamp":1765544976296,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"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":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671729","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1804-1815","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Auto-Bidding Strategies for Online Advertising"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7038-2581","authenticated-orcid":false,"given":"Qilong","family":"Lin","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-5331","authenticated-orcid":false,"given":"Zhenzhe","family":"Zheng","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0965-9058","authenticated-orcid":false,"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Laurent El Ghaoui, and Arkadi Nemirovski","author":"Ben-Tal Aharon","year":"2009","unstructured":"Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski. 2009. Robust Optimization. Princeton University Press."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/66.3.429"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"A. Charnes and W. W. Cooper. 1959. Chance-Constrained Programming. Management science Vol. 6 1 (1959) 73--79.","DOI":"10.1287\/mnsc.6.1.73"},{"key":"e_1_3_2_2_4_1","volume-title":"Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations research","author":"Delage Erick","year":"2010","unstructured":"Erick Delage and Yinyu Ye. 2010. Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations research, Vol. 58, 3 (2010), 595--612."},{"key":"e_1_3_2_2_5_1","volume-title":"Operations research","author":"Delage Erick","year":"2010","unstructured":"Erick Delage and Yinyu Ye. 2010. Wiesemann, Wolfram and Kuhn, Daniel and Sim, Melvyn. Operations research, Vol. 62, 6 (2010), 1358--1376."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124752"},{"key":"e_1_3_2_2_7_1","unstructured":"Aritra Ghosh Saayan Mitra Somdeb Sarkhel Jason Xie Gang Wu and Viswanathan Swaminathan. 2020. Scalable Bid Landscape Forecasting in Real-Time Bidding. In Machine Learning and Knowledge Discovery in Databases. 451--466."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412689"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02063-6"},{"key":"e_1_3_2_2_10_1","first-page":"2771","article-title":"Non-convex Distributionally Robust Optimization","volume":"34","author":"Jin Jikai","year":"2021","unstructured":"Jikai Jin, Bohang Zhang, Haiyang Wang, and Liwei Wang. 2021. Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis. Advances in Neural Information Processing Systems, Vol. 34 (2021), 2771--2782.","journal-title":"Non-asymptotic Analysis. Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_11_1","volume-title":"Adaptive Bid Shading Optimization of First-Price Ad Inventory. In 2021 American Control Conference (ACC). 4983--4990","author":"Karlsson Niklas","year":"2021","unstructured":"Niklas Karlsson and Qian Sang. 2021. Adaptive Bid Shading Optimization of First-Price Ad Inventory. In 2021 American Control Conference (ACC). 4983--4990."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3219"},{"key":"e_1_3_2_2_13_1","volume-title":"Viet Anh Nguyen, and Soroosh Shafieezadeh-Abadeh.","author":"Kuhn Daniel","year":"2019","unstructured":"Daniel Kuhn, Peyman Mohajerin Esfahani, Viet Anh Nguyen, and Soroosh Shafieezadeh-Abadeh. 2019. Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning. arxiv: 1908.08729"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539048"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648590"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2021057"},{"key":"e_1_3_2_2_17_1","volume-title":"Optimal auction design. Mathematics of operations research","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research, Vol. 6, 1 (1981), 58--73."},{"key":"e_1_3_2_2_18_1","volume-title":"Vazirani","author":"Nisan Noam","year":"2007","unstructured":"Noam Nisan, Tim Roughgarden, \u00c9va Tardos, and Vijay V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599799"},{"key":"e_1_3_2_2_20_1","volume-title":"Bid Shading by Win-Rate Estimation and Surplus Maximization. arxiv","author":"Pan Shengjun","year":"2009","unstructured":"Shengjun Pan, Brendan Kitts, Tian Zhou, Hao He, Bharatbhushan Shetty, Aaron Flores, Djordje Gligorijevic, Junwei Pan, Tingyu Mao, San Gultekin, and Jianlong Zhang. 2020. Bid Shading by Win-Rate Estimation and Surplus Maximization. arxiv: 2009.09259"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5802\/ojmo.15"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330870"},{"key":"e_1_3_2_2_23_1","volume-title":"Conditional Density Estimation with Neural Networks: Best Practices and Benchmarks. arxiv","author":"Rothfuss Jonas","year":"1903","unstructured":"Jonas Rothfuss, Fabio Ferreira, Simon Walther, and Maxim Ulrich. 2019. Conditional Density Estimation with Neural Networks: Best Practices and Benchmarks. arxiv: 1903.00954"},{"volume-title":"A min-max solution of an inventory problem","author":"Scarf Herbert E","key":"e_1_3_2_2_24_1","unstructured":"Herbert E Scarf, KJ Arrow, and S Karlin. 1957. A min-max solution of an inventory problem. Rand Corporation Santa Monica."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1118101"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680833119"},{"key":"e_1_3_2_2_27_1","volume-title":"Reddy","author":"Wang Ping","year":"2019","unstructured":"Ping Wang, Yan Li, and Chandan K. Reddy. 2019. Machine Learning for Survival Analysis: A Survey. ACM Comput. Surv., Vol. 51, 6 (2019), 36 pages."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109248"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919450"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Yuchen Wang Kan Ren Weinan Zhang Jun Wang and Yong Yu. 2016. Functional Bid Landscape Forecasting for Display Advertising. In Machine Learning and Knowledge Discovery in Databases. 115--131.","DOI":"10.1007\/978-3-319-46128-1_8"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220066"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of SIGKDD. 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 SIGKDD. 1305--1314."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SOLI.2014.6960761"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467113"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467167"},{"key":"e_1_3_2_2_36_1","volume-title":"Huane Zhen Yu, and MA Wolfe","author":"Zuhe Shen","year":"1997","unstructured":"Shen Zuhe, Huane Zhen Yu, and MA Wolfe. 1997. An Interval Maximum Entropy Method for a Discrete Minimax Problem. Applied mathematics and computation, Vol. 87, 1 (1997), 49--68."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:01Z","timestamp":1750291561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":36,"alternative-id":["10.1145\/3637528.3671729","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671729","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}