{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T21:10:09Z","timestamp":1693429809489},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583491","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Bidding Algorithms for Return-on-Spend Constrained Advertisers\u2731"],"prefix":"10.1145","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-6036-375X","authenticated-orcid":false,"given":"Zhe","family":"Feng","sequence":"first","affiliation":[{"name":"Google Research, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4834-2136","authenticated-orcid":false,"given":"Swati","family":"Padmanabhan","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0891-0255","authenticated-orcid":false,"given":"Di","family":"Wang","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35389-6_2"},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405\u20131424","author":"Agrawal Shipra","year":"2014","unstructured":"Shipra Agrawal and Nikhil\u00a0 R Devanur . 2014 . Fast algorithms for online stochastic convex programming . In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405\u20131424 . Shipra Agrawal and Nikhil\u00a0R Devanur. 2014. Fast algorithms for online stochastic convex programming. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405\u20131424."},{"key":"e_1_3_2_2_3_1","unstructured":"Rui Ai Chang Wang Chenchen Li Jinshan Zhang Wenhan Huang and Xiaotie Deng. 2022. No-regret Learning in Repeated First-Price Auctions with Budget Constraints. Rui Ai Chang Wang Chenchen Li Jinshan Zhang Wenhan Huang and Xiaotie Deng. 2022. No-regret Learning in Repeated First-Price Auctions with Budget Constraints."},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1439\u20131456","author":"Allen-Zhu Zeyuan","year":"2014","unstructured":"Zeyuan Allen-Zhu and Lorenzo Orecchia . 2014 . Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel . In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1439\u20131456 . Zeyuan Allen-Zhu and Lorenzo Orecchia. 2014. Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1439\u20131456."},{"key":"e_1_3_2_2_5_1","volume-title":"Non-Quasi-Linear Agents in Quasi-Linear Mechanisms. In 12th Innovations in Theoretical Computer Science Conference (ITCS","author":"Babaioff Moshe","year":"2021","unstructured":"Moshe Babaioff , Richard Cole , Jason Hartline , Nicole Immorlica , and Brendan Lucier . 2021 . Non-Quasi-Linear Agents in Quasi-Linear Mechanisms. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Moshe Babaioff, Richard Cole, Jason Hartline, Nicole Immorlica, and Brendan Lucier. 2021. Non-Quasi-Linear Agents in Quasi-Linear Mechanisms. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_6_1","volume-title":"Learning to Bid in Contextual First Price Auctions. CoRR abs\/2109.03173","author":"Badanidiyuru Ashwinkumar","year":"2021","unstructured":"Ashwinkumar Badanidiyuru , Zhe Feng , and Guru Guruganesh . 2021. Learning to Bid in Contextual First Price Auctions. CoRR abs\/2109.03173 ( 2021 ). arXiv:2109.03173 Ashwinkumar Badanidiyuru, Zhe Feng, and Guru Guruganesh. 2021. Learning to Bid in Contextual First Price Auctions. CoRR abs\/2109.03173 (2021). arXiv:2109.03173"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_2_8_1","first-page":"17777","article-title":"Robust Auction Design in the Auto-bidding World","volume":"34","author":"Balseiro Santiago","year":"2021","unstructured":"Santiago Balseiro , Yuan Deng , Jieming Mao , Vahab Mirrokni , and Song Zuo . 2021 . Robust Auction Design in the Auto-bidding World . Advances in Neural Information Processing Systems 34 (2021), 17777 \u2013 17788 . Santiago Balseiro, Yuan Deng, Jieming Mao, Vahab Mirrokni, and Song Zuo. 2021. Robust Auction Design in the Auto-bidding World. Advances in Neural Information Processing Systems 34 (2021), 17777\u201317788.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3524996"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467607"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_2_13_1","volume-title":"A Unifying Framework for Online Optimization with Long-Term Constraints. arXiv preprint arXiv:2209.07454","author":"Castiglioni Matteo","year":"2022","unstructured":"Matteo Castiglioni , Andrea Celli , Alberto Marchesi , Giulia Romano , and Nicola Gatti . 2022. A Unifying Framework for Online Optimization with Long-Term Constraints. arXiv preprint arXiv:2209.07454 ( 2022 ). Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, and Nicola Gatti. 2022. A Unifying Framework for Online Optimization with Long-Term Constraints. arXiv preprint arXiv:2209.07454 (2022)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512061"},{"key":"e_1_3_2_2_15_1","volume-title":"Pacing Equilibrium in First Price Auction Markets. Management Science","author":"Conitzer Vincent","year":"2022","unstructured":"Vincent Conitzer , Christian Kroer , Debmalya Panigrahi , Okke Schrijvers , Nicolas\u00a0 E Stier-Moses , Eric Sodomka , and Christopher\u00a0 A Wilkens . 2022. Pacing Equilibrium in First Price Auction Markets. Management Science ( 2022 ). Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Nicolas\u00a0E Stier-Moses, Eric Sodomka, and Christopher\u00a0A Wilkens. 2022. Pacing Equilibrium in First Price Auction Markets. Management Science (2022)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2167"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450052"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284177"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219208"},{"key":"e_1_3_2_2_21_1","volume-title":"Bidding Agent Design in the LinkedIn Ad Marketplace. arXiv preprint arXiv:2202.12472","author":"Gao Yuan","year":"2022","unstructured":"Yuan Gao , Kaiyu Yang , Yuanlong Chen , Min Liu , and Noureddine\u00a0El Karoui . 2022. Bidding Agent Design in the LinkedIn Ad Marketplace. arXiv preprint arXiv:2202.12472 ( 2022 ). Yuan Gao, Kaiyu Yang, Yuanlong Chen, Min Liu, and Noureddine\u00a0El Karoui. 2022. Bidding Agent Design in the LinkedIn Ad Marketplace. arXiv preprint arXiv:2202.12472 (2022)."},{"key":"e_1_3_2_2_22_1","volume-title":"Jason Cheuk\u00a0Nam Liang, and Vahab Mirrokni","author":"Golrezaei Negin","year":"2021","unstructured":"Negin Golrezaei , Patrick Jaillet , Jason Cheuk\u00a0Nam Liang, and Vahab Mirrokni . 2021 . Bidding and Pricing in Budget and ROI Constrained Markets . arXiv preprint arXiv:2107.07725 (2021). Negin Golrezaei, Patrick Jaillet, Jason Cheuk\u00a0Nam Liang, and Vahab Mirrokni. 2021. Bidding and Pricing in Budget and ROI Constrained Markets. arXiv preprint arXiv:2107.07725 (2021)."},{"key":"e_1_3_2_2_23_1","volume-title":"Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions. CoRR abs\/2007.04568","author":"Han Yanjun","year":"2020","unstructured":"Yanjun Han , Zhengyuan Zhou , Aaron Flores , Erik Ordentlich , and Tsachy Weissman . 2020. Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions. CoRR abs\/2007.04568 ( 2020 ). arxiv:2007.04568 Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman. 2020. Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions. CoRR abs\/2007.04568 (2020). arxiv:2007.04568"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00022"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503322"},{"key":"e_1_3_2_2_26_1","volume-title":"Stochastic convex optimization with multiple objectives. Advances in neural information processing systems 26","author":"Mahdavi Mehrdad","year":"2013","unstructured":"Mehrdad Mahdavi , Tianbao Yang , and Rong Jin . 2013. Stochastic convex optimization with multiple objectives. Advances in neural information processing systems 26 ( 2013 ). Mehrdad Mahdavi, Tianbao Yang, and Rong Jin. 2013. Stochastic convex optimization with multiple objectives. Advances in neural information processing systems 26 (2013)."},{"key":"e_1_3_2_2_27_1","volume-title":"Online Learning with Sample Path Constraints.Journal of Machine Learning Research 10, 3","author":"Mannor Shie","year":"2009","unstructured":"Shie Mannor , John\u00a0 N Tsitsiklis , and Jia\u00a0Yuan Yu. 2009. Online Learning with Sample Path Constraints.Journal of Machine Learning Research 10, 3 ( 2009 ). Shie Mannor, John\u00a0N Tsitsiklis, and Jia\u00a0Yuan Yu. 2009. Online Learning with Sample Path Constraints.Journal of Machine Learning Research 10, 3 (2009)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_2_29_1","volume-title":"Optimal auction design. Mathematics of operations research 6, 1","author":"Myerson B","year":"1981","unstructured":"Roger\u00a0 B Myerson . 1981. Optimal auction design. Mathematics of operations research 6, 1 ( 1981 ), 58\u201373. Roger\u00a0B Myerson. 1981. Optimal auction design. Mathematics of operations research 6, 1 (1981), 58\u201373."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000077"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449968"},{"key":"e_1_3_2_2_32_1","volume-title":"Conference on Learning Theory. PMLR, 1562\u20131583","author":"Weed Jonathan","year":"2016","unstructured":"Jonathan Weed , Vianney Perchet , and Philippe Rigollet . 2016 . Online learning in repeated auctions . In Conference on Learning Theory. PMLR, 1562\u20131583 . Jonathan Weed, Vianney Perchet, and Philippe Rigollet. 2016. Online learning in repeated auctions. In Conference on Learning Theory. PMLR, 1562\u20131583."},{"key":"e_1_3_2_2_33_1","volume-title":"Online convex optimization with stochastic constraints. Advances in Neural Information Processing Systems 30","author":"Yu Hao","year":"2017","unstructured":"Hao Yu , Michael Neely , and Xiaohan Wei . 2017. Online convex optimization with stochastic constraints. Advances in Neural Information Processing Systems 30 ( 2017 ). Hao Yu, Michael Neely, and Xiaohan Wei. 2017. Online convex optimization with stochastic constraints. Advances in Neural Information Processing Systems 30 (2017)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3455716.3455717"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T20:49:37Z","timestamp":1693428577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":34,"alternative-id":["10.1145\/3543507.3583491","10.1145\/3543507"],"URL":"http:\/\/dx.doi.org\/10.1145\/3543507.3583491","relation":{},"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}