{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T14:49:48Z","timestamp":1780843788189,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"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":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649688","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"213-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Strategic Budget Selection in a Competitive Autobidding World"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8258-6994","authenticated-orcid":false,"given":"Yiding","family":"Feng","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3497-0875","authenticated-orcid":false,"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6899-6383","authenticated-orcid":false,"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft Research, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35389-6_2"},{"key":"e_1_3_2_1_2_1","unstructured":"Airbnb. 2023. Smart Pricing."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597725"},{"key":"e_1_3_2_1_4_1","unstructured":"Amazon. 2023. Adjust pricing quickly and automatically."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66700-3_1"},{"key":"e_1_3_2_1_6_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). 185, 84."},{"key":"e_1_3_2_1_7_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\u201317788.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052682"},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Machine Learning. 613\u2013628","author":"Balseiro Santiago","year":"2020","unstructured":"Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2020. Dual mirror descent for online allocation problems. In International Conference on Machine Learning. 613\u2013628."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467607"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2242"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 6th ACM Conf. on Electronic Commerce.","author":"Borgs C.","unstructured":"C. Borgs, J. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. 2005. Multi-unit auctions with budget-constrained bidders. In Proc. 6th ACM Conf. on Electronic Commerce."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9674-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219186"},{"key":"e_1_3_2_1_17_1","first-page":"33589","article-title":"A unifying framework for online optimization with long-term constraints","volume":"35","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. Advances in Neural Information Processing Systems, 35 (2022), 33589\u201333602.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467578"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48433-3_13"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Vincent Conitzer Christian Kroer Debmalya Panigrahi Okke Schrijvers Nicolas E Stier-Moses Eric Sodomka and Christopher A Wilkens. 2022. Pacing Equilibrium in First Price Auction Markets. Management Science.","DOI":"10.1287\/mnsc.2022.4310"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2167"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yuan Deng Mohammad Mahdian Jieming Mao Vahab Mirrokni Hanrui Zhang and Song Zuo. 2023. Efficiency of the Generalized Second-Price Auction for Value Maximizers. arXiv preprint arXiv:2310.03105.","DOI":"10.1145\/3589334.3645360"},{"key":"e_1_3_2_1_23_1","unstructured":"Yuan Deng Jieming Mao Vahab Mirrokni Hanrui Zhang and Song Zuo. 2022. Efficiency of the first-price auction in the autobidding world. arXiv preprint arXiv:2208.10650."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450052"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski and Renato Paes Leme. 2014. Efficiency guarantees in auctions with budgets. In International Colloquium on Automata Languages and Programming. 392\u2013404.","DOI":"10.1007\/978-3-662-43948-7_33"},{"key":"e_1_3_2_1_26_1","unstructured":"Expedia. 2023. Find our lowest price on your next flight with Price Tracking."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 24th ACM Conference on Economics and Computation. 678\u2013698","author":"Giannis","unstructured":"Giannis Fikioris and \u00c9va Tardos. 2023. Liquid welfare guarantees for no-regret learning in sequential budgeted auctions. In Proceedings of the 24th ACM Conference on Economics and Computation. 678\u2013698."},{"key":"e_1_3_2_1_28_1","volume-title":"Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence. In 14th Innovations in Theoretical Computer Science Conference (ITCS","author":"Gaitonde Jason","year":"2023","unstructured":"Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins. 2023. Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). 251, 52."},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference on Artificial Intelligence and Statistics. 9282\u20139307","author":"Golrezaei Negin","year":"2023","unstructured":"Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2023. Pricing against a Budget and ROI Constrained Buyer. In International Conference on Artificial Intelligence and Statistics. 9282\u20139307."},{"key":"e_1_3_2_1_30_1","unstructured":"Google. 2023. About automated bidding."},{"key":"e_1_3_2_1_31_1","unstructured":"John Richard Hicks. 1975. Value and capital: An inquiry into some fundamental principles of economic theory. OUP Catalogue."},{"key":"e_1_3_2_1_32_1","unstructured":"Hopper. 2023. How do Price Predictions work with Hopper?"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512055"},{"key":"e_1_3_2_1_34_1","first-page":"28080","article-title":"How and why to manipulate your own agent: On the incentives of users of learning agents","volume":"35","author":"Kolumbus Yoav","year":"2022","unstructured":"Yoav Kolumbus and Noam Nisan. 2022. How and why to manipulate your own agent: On the incentives of users of learning agents. Advances in Neural Information Processing Systems, 35 (2022), 28080\u201328094.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_35_1","unstructured":"Juncheng Li and Pingzhong Tang. 2022. Auto-bidding Equilibrium in ROI-Constrained Online Advertising Markets. arXiv preprint arXiv:2210.06107."},{"key":"e_1_3_2_1_36_1","unstructured":"Christopher Liaw Aranyak Mehta and Andres Perlroth. 2022. Efficiency of non-truthful auctions under auto-bidding. arXiv preprint arXiv:2207.03630."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764500"},{"key":"e_1_3_2_1_38_1","unstructured":"Brendan Lucier Sarath Pattathil Aleksandrs Slivkins and Mengxiao Zhang. 2023. Autobidders with budget and roi constraints: Efficiency regret and pacing dynamics. arXiv preprint arXiv:2301.13306."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512062"},{"key":"e_1_3_2_1_40_1","unstructured":"Aranyak Mehta and Andres Perlroth. 2023. Auctions without commitment in the auto-bidding world. arXiv preprint arXiv:2301.07312."},{"key":"e_1_3_2_1_41_1","unstructured":"Meta. 2023. About Meta Bid Strategies."},{"key":"e_1_3_2_1_42_1","unstructured":"Microsoft. 2023. Automated bidding."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":43,"alternative-id":["10.1145\/3618260.3649688","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649688","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}