{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:23Z","timestamp":1781078303093,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":53,"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\/"}],"funder":[{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["PNRR-PE-AI FAIR project funded by the NextGeneration EU program"],"award-info":[{"award-number":["PNRR-PE-AI FAIR project funded by the NextGeneration EU program"]}]},{"name":"European Research Council","award":["ERC Advanced Grant 788893 AMDROMA ?Algorithmic and Mechanism Design Research in Online Markets?"],"award-info":[{"award-number":["ERC Advanced Grant 788893 AMDROMA ?Algorithmic and Mechanism Design Research in Online Markets?"]}]},{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["PNRR MUR project PE0000013- FAIR?, and PNRR MUR project IR0000013-SoBigData.it"],"award-info":[{"award-number":["PNRR MUR project PE0000013- FAIR?, and PNRR MUR project IR0000013-SoBigData.it"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649653","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"247-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["No-Regret Learning in Bilateral Trade via Global Budget Balance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8594-2528","authenticated-orcid":false,"given":"Martino","family":"Bernasconi","sequence":"first","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1070-6766","authenticated-orcid":false,"given":"Matteo","family":"Castiglioni","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-4019","authenticated-orcid":false,"given":"Andrea","family":"Celli","sequence":"additional","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6250-945X","authenticated-orcid":false,"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"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.1287\/opre.2019.1840"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/140989455"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_4_1","unstructured":"Yossi Azar Amos Fiat and Federico Fusco. 2022. An alpha-regret analysis of Adversarial Bilateral Trade. In NeurIPS."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0663"},{"key":"e_1_3_2_1_8_1","volume-title":"No-Regret Learning in Bilateral Trade via Global Budget Balance. CoRR, abs\/2310.12370","author":"Bernasconi Martino","year":"2023","unstructured":"Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco. 2023. No-Regret Learning in Bilateral Trade via Global Budget Balance. CoRR, abs\/2310.12370 (2023)."},{"key":"e_1_3_2_1_9_1","unstructured":"Martino Bernasconi Matteo Castiglioni Andrea Celli and Federico Fusco. 2024. Bandits with Replenishable Knapsacks: the Best of both Worlds. In ICLR."},{"key":"e_1_3_2_1_10_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"2183","author":"Bernasconi Martino","year":"2023","unstructured":"Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Francesco Trov\u00f2, and Nicola Gatti. 2023. Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. In ICML (Proceedings of Machine Learning Research, Vol. 202). PMLR, 2164\u20132183."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Liad Blumrosen and Shahar Dobzinski. 2014. Reallocation mechanisms. In EC. ACM 617. https:\/\/doi.org\/10.1145\/2600057.2602843 10.1145\/2600057.2602843","DOI":"10.1145\/2600057.2602843"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_28"},{"key":"e_1_3_2_1_13_1","volume-title":"An Online Learning Theory of Brokerage. The 23rd International Conference on Autonomous Agents and Multi-Agent Systems.","author":"Boli\u0107 Nata\u0161a","year":"2024","unstructured":"Nata\u0161a Boli\u0107, Tommaso Cesari, and Roberto Colomboni. 2024. An Online Learning Theory of Brokerage. The 23rd International Conference on Autonomous Agents and Multi-Agent Systems."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085148"},{"key":"e_1_3_2_1_15_1","volume-title":"ICML (Proceedings of Machine Learning Research","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 ICML (Proceedings of Machine Learning Research, Vol. 162). PMLR, 2767\u20132783."},{"key":"e_1_3_2_1_16_1","unstructured":"Matteo Castiglioni Andrea Celli Alberto Marchesi and Nicola Gatti. 2020. Online Bayesian Persuasion. In NeurIPS."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103821"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Nicol\u00f2 Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco and Stefano Leonardi. 2021. A Regret Analysis of Bilateral Trade. In EC. ACM 289\u2013309. https:\/\/doi.org\/10.1145\/3465456.3467645 10.1145\/3465456.3467645","DOI":"10.1145\/3465456.3467645"},{"key":"e_1_3_2_1_19_1","volume-title":"COLT (Proceedings of Machine Learning Research","volume":"1130","author":"Cesa-Bianchi Nicol\u00f2","year":"2023","unstructured":"Nicol\u00f2 Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi. 2023. Repeated Bilateral Trade Against a Smoothed Adversary. In COLT (Proceedings of Machine Learning Research, Vol. 195). PMLR, 1095\u20131130."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.1351"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Nicol\u00f2 Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco and Stefano Leonardi. 2024. The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. In STOC. ACM.","DOI":"10.1145\/3618260.3649658"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365772"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0206"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2022.03.001"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Yuan Deng Jieming Mao Balasubramanian Sivan and Kangning Wang. 2022. Approximately efficient bilateral trade. In STOC. ACM 718\u2013721. https:\/\/doi.org\/10.1145\/3519935.3520054 10.1145\/3519935.3520054","DOI":"10.1145\/3519935.3520054"},{"key":"e_1_3_2_1_26_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"8850","author":"Duetting Paul","year":"2023","unstructured":"Paul Duetting, Guru Guruganesh, Jon Schneider, and Joshua Ruizhi Wang. 2023. Optimal No-Regret Learning for One-Sided Lipschitz Functions. In ICML (Proceedings of Machine Learning Research, Vol. 202). PMLR, 8836\u20138850."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Paul D\u00fctting Federico Fusco Philip Lazos Stefano Leonardi and Rebecca Reiffenh\u00e4user. 2021. Efficient two-sided markets with limited information. In STOC. ACM 1452\u20131465. https:\/\/doi.org\/10.1145\/3406325.3451076 10.1145\/3406325.3451076","DOI":"10.1145\/3406325.3451076"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22832-2_12"},{"key":"e_1_3_2_1_29_1","volume-title":"Online pricing with strategic and patient buyers. Advances in Neural Information Processing Systems, 29","author":"Feldman Michal","year":"2016","unstructured":"Michal Feldman, Tomer Koren, Roi Livni, Yishay Mansour, and Aviv Zohar. 2016. Online pricing with strategic and patient buyers. Advances in Neural Information Processing Systems, 29 (2016)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4940"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3557045"},{"key":"e_1_3_2_1_32_1","volume-title":"Adaptive Algorithms for Online Convex Optimization with Long-term Constraints. In ICML (JMLR Workshop and Conference Proceedings","volume":"411","author":"Jenatton Rodolphe","year":"2016","unstructured":"Rodolphe Jenatton, Jim C. Huang, and C\u00e9dric Archambeau. 2016. Adaptive Algorithms for Online Convex Optimization with Long-term Constraints. In ICML (JMLR Workshop and Conference Proceedings, Vol. 48). JMLR.org, 402\u2013411."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/070701704"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.115"},{"key":"e_1_3_2_1_35_1","volume-title":"COLT (Proceedings of Machine Learning Research","volume":"2305","author":"Kesselheim Thomas","year":"2020","unstructured":"Thomas Kesselheim and Sahil Singla. 2020. Online Learning with Vector Costs and Bandits with Knapsacks. In COLT (Proceedings of Machine Learning Research, Vol. 125). PMLR, 2286\u20132305."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238232"},{"key":"e_1_3_2_1_37_1","unstructured":"Raunak Kumar and Robert Kleinberg. 2022. Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem. In NeurIPS."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch17"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503322"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577089"},{"key":"e_1_3_2_1_41_1","volume-title":"The gains from trade under fixed price mechanisms. Applied economics research bulletin, 1, 1","author":"McAfee R Preston","year":"2008","unstructured":"R Preston McAfee. 2008. The gains from trade under fixed price mechanisms. Applied economics research bulletin, 1, 1 (2008), 1\u201310."},{"key":"e_1_3_2_1_42_1","unstructured":"Jamie Morgenstern and Tim Roughgarden. 2015. On the Pseudo-Dimension of Nearly Optimal Auctions. In NIPS. 136\u2013144."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(83)90048-0"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000077"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_1_47_1","volume-title":"Karthik Abinav Sankararaman, and Dylan J. Foster","author":"Slivkins Aleksandrs","year":"2023","unstructured":"Aleksandrs Slivkins, Karthik Abinav Sankararaman, and Dylan J. Foster. 2023. Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression. In COLT (Proceedings of Machine Learning Research, Vol. 195). PMLR, 4633\u20134656."},{"key":"e_1_3_2_1_48_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"3288","author":"Sun Wen","year":"2017","unstructured":"Wen Sun, Debadeepta Dey, and Ashish Kapoor. 2017. Safety-Aware Algorithms for Adversarial Contextual Bandit. In ICML (Proceedings of Machine Learning Research, Vol. 70). PMLR, 3280\u20133288."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_50_1","volume-title":"COLT (JMLR Workshop and Conference Proceedings","volume":"1583","author":"Weed Jonathan","year":"2016","unstructured":"Jonathan Weed, Vianney Perchet, and Philippe Rigollet. 2016. Online learning in repeated auctions. In COLT (JMLR Workshop and Conference Proceedings, Vol. 49). JMLR.org, 1562\u20131583."},{"key":"e_1_3_2_1_51_1","unstructured":"Hao Yu Michael J. Neely and Xiaohan Wei. 2017. Online Convex Optimization with Stochastic Constraints. In NIPS. 1428\u20131438."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597673"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","unstructured":"You Zu Krishnamurthy Iyer and Haifeng Xu. 2021. Learning to Persuade on the Fly: Robustness Against Ignorance. In EC. ACM 927\u2013928. https:\/\/doi.org\/10.1145\/3465456.3467593 10.1145\/3465456.3467593","DOI":"10.1145\/3465456.3467593"}],"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.3649653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649653","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.3649653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":53,"alternative-id":["10.1145\/3618260.3649653","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649653","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"}}]}}