{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T06:02:13Z","timestamp":1759730533328,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0183","FA9550-23-1-0068"],"award-info":[{"award-number":["FA9550-19-1-0183","FA9550-23-1-0068"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1408673"],"award-info":[{"award-number":["CCF-1408673"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Onassis Foundation","award":["F ZS 068-1\/2022-2023"],"award-info":[{"award-number":["F ZS 068-1\/2022-2023"]}]},{"name":"NDSEG Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597772","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"678-698","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4920-478X","authenticated-orcid":false,"given":"Giannis","family":"Fikioris","sequence":"first","affiliation":[{"name":"Computer Science, Cornell University, Ithaca, New York, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2978-1475","authenticated-orcid":false,"given":"Eva","family":"Tardos","sequence":"additional","affiliation":[{"name":"Computer Science, Cornell University, Ithaca, New York, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"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","volume-title":"Adjustment of Bidding Strategies After a Switch to First-Price Rules. Available at SSRN 4036006","author":"Alcobendas Miguel","year":"2021","unstructured":"Miguel Alcobendas and Robert Zeithammer . 2021. Adjustment of Bidding Strategies After a Switch to First-Price Rules. Available at SSRN 4036006 ( 2021 ). Miguel Alcobendas and Robert Zeithammer. 2021. Adjustment of Bidding Strategies After a Switch to First-Price Rules. Available at SSRN 4036006 (2021)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.84"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3084088"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2073"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538258"},{"key":"e_1_3_2_1_8_1","volume-title":"Online Learning with Knapsacks: the Best of Both Worlds. In International Conference on Machine Learning, ICML 2022","volume":"2783","author":"Castiglioni Matteo","year":"2022","unstructured":"Matteo Castiglioni , Andrea Celli , and Christian Kroer . 2022 . Online Learning with Knapsacks: the Best of Both Worlds. In International Conference on Machine Learning, ICML 2022 , 17--23 July 2022, Baltimore, Maryland, USA (Proceedings of Machine Learning Research , Vol. 162), Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesv\u00e1ri, Gang Niu, and Sivan Sabato (Eds.). PMLR, 2767-- 2783 . https:\/\/proceedings.mlr.press\/v162\/castiglioni22a.html Matteo Castiglioni, Andrea Celli, and Christian Kroer. 2022. Online Learning with Knapsacks: the Best of Both Worlds. In International Conference on Machine Learning, ICML 2022, 17--23 July 2022, Baltimore, Maryland, USA (Proceedings of Machine Learning Research, Vol. 162), Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesv\u00e1ri, Gang Niu, and Sivan Sabato (Eds.). PMLR, 2767--2783. https:\/\/proceedings.mlr.press\/v162\/castiglioni22a.html"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2203.16816"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2207.04690"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/isre.2019.0902"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329600"},{"key":"e_1_3_2_1_13_1","volume-title":"WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings (Lecture Notes in Computer Science","volume":"443","author":"Conitzer Vincent","unstructured":"Vincent Conitzer , Christian Kroer , Eric Sodomka , and Nicol\u00e1s E . Stier Moses. 2018. Multiplicative Pacing Equilibria in Auction Markets. In Web and Internet Economics - 14th International Conference , WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings (Lecture Notes in Computer Science , Vol. 11316), George Christodoulou and Tobias Harks (Eds.). Springer, 443 . https:\/\/link.springer.com\/content\/pdf\/bbm%3A978-3-030-04612-5%2F1.pdf Vincent Conitzer, Christian Kroer, Eric Sodomka, and Nicol\u00e1s E. Stier Moses. 2018. Multiplicative Pacing Equilibria in Auction Markets. In Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings (Lecture Notes in Computer Science, Vol. 11316), George Christodoulou and Tobias Harks (Eds.). Springer, 443. https:\/\/link.springer.com\/content\/pdf\/bbm%3A978-3-030-04612-5%2F1.pdf"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512059"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450052"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1177\/00222437211030201"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_33"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16680"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2302.14686"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011949"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2205.08674"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00022"},{"key":"e_1_3_2_1_23_1","volume-title":"Online Learning with Vector Costs and Bandits with Knapsacks. In Conference on Learning Theory, COLT 2020","volume":"2305","author":"Kesselheim Thomas","year":"2020","unstructured":"Thomas Kesselheim and Sahil Singla . 2020 . Online Learning with Vector Costs and Bandits with Knapsacks. In Conference on Learning Theory, COLT 2020 , 9--12 July 2020, Virtual Event [Graz, Austria] (Proceedings of Machine Learning Research , Vol. 125), Jacob D. Abernethy and Shivani Agarwal (Eds.). PMLR, 2286-- 2305 . http:\/\/proceedings.mlr.press\/v125\/kesselheim20a.html Thomas Kesselheim and Sahil Singla. 2020. Online Learning with Vector Costs and Bandits with Knapsacks. In Conference on Learning Theory, COLT 2020, 9--12 July 2020, Virtual Event [Graz, Austria] (Proceedings of Machine Learning Research, Vol. 125), Jacob D. Abernethy and Shivani Agarwal (Eds.). PMLR, 2286--2305. http:\/\/proceedings.mlr.press\/v125\/kesselheim20a.html"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512055"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2301.13306"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488635"},{"key":"e_1_3_2_1_28_1","unstructured":"Matt Wong. 2021. Moving AdSense to a first-price auction. https:\/\/blog.google\/products\/adsense\/our-move-to-a-first-price-auction\/  Matt Wong. 2021. Moving AdSense to a first-price auction. https:\/\/blog.google\/products\/adsense\/our-move-to-a-first-price-auction\/"},{"key":"e_1_3_2_1_29_1","unstructured":"Meaghan Yuen. 2022. Programmatic advertising in 2022: Digital Display Ads Industry. https:\/\/www.insiderintelligence.com\/insights\/programmatic-digital-display-ad-spending  Meaghan Yuen. 2022. Programmatic advertising in 2022: Digital Display Ads Industry. https:\/\/www.insiderintelligence.com\/insights\/programmatic-digital-display-ad-spending"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597772","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":29,"alternative-id":["10.1145\/3580507.3597772","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597772","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}