{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T10:48:14Z","timestamp":1776854894246,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["FAI-2147212"],"award-info":[{"award-number":["FAI-2147212"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2217062"],"award-info":[{"award-number":["CCF-2217062"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673460","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"511-541","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Prior-Free Mechanisms for No-Regret Agents"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2584-7728","authenticated-orcid":false,"given":"Natalie","family":"Collina","sequence":"first","affiliation":[{"name":"Computer and Information Science, University of Pennsylvania, Philadelphia, Pennsylvania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0586-0515","authenticated-orcid":false,"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, Pennsylvania, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9206-1357","authenticated-orcid":false,"given":"Han","family":"Shao","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764478"},{"key":"e_1_3_2_1_2_1","volume-title":"International Conference on Machine Learning. PMLR, 2164--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 International Conference on Machine Learning. PMLR, 2164--2183."},{"key":"e_1_3_2_1_3_1","first-page":"15917","article-title":"Sequential information design: Learning to persuade in the dark","volume":"35","author":"Bernasconi Martino","year":"2022","unstructured":"Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, and Francesco Trov\u00f2. 2022. Sequential information design: Learning to persuade in the dark. Advances in Neural Information Processing Systems 35 (2022), 15917--15928.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_4_1","volume-title":"Learning optimal commitment to overcome insecurity. Advances in Neural Information Processing Systems 27","author":"Blum Avrim","year":"2014","unstructured":"Avrim Blum, Nika Haghtalab, and Ariel D Procaccia. 2014. Learning optimal commitment to overcome insecurity. Advances in Neural Information Processing Systems 27 (2014)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374430"},{"key":"e_1_3_2_1_6_1","article-title":"From external to internal regret","volume":"8","author":"Blum Avrim","year":"2007","unstructured":"Avrim Blum and Yishay Mansour. 2007. From external to internal regret. Journal of Machine Learning Research 8, 6 (2007).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_7_1","volume-title":"Contract theory","author":"Bolton Patrick","unstructured":"Patrick Bolton and Mathias Dewatripont. 2004. Contract theory. MIT press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219233"},{"key":"e_1_3_2_1_9_1","volume-title":"Is Learning in Games Good for the Learners? arXiv preprint arXiv:2305.19496","author":"Brown William","year":"2023","unstructured":"William Brown, Jon Schneider, and Kiran Vodrahalli. 2023. Is Learning in Games Good for the Learners? arXiv preprint arXiv:2305.19496 (2023)."},{"key":"e_1_3_2_1_10_1","volume-title":"Selling to Multiple No-Regret Buyers. arXiv preprint arXiv:2307.04175","author":"Cai Linda","year":"2023","unstructured":"Linda Cai, S Matthew Weinberg, Evan Wildenhain, and Shirley Zhang. 2023. Selling to Multiple No-Regret Buyers. arXiv preprint arXiv:2307.04175 (2023)."},{"key":"e_1_3_2_1_11_1","volume-title":"Mechanisms for a no-regret agent: Beyond the common prior. In 2020 ieee 61st annual symposium on foundations of computer science (focs)","author":"Camara Modibo K","unstructured":"Modibo K Camara, Jason D Hartline, and Aleck Johnsen. 2020. Mechanisms for a no-regret agent: Beyond the common prior. In 2020 ieee 61st annual symposium on foundations of computer science (focs). IEEE, 259--270."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20131159"},{"key":"e_1_3_2_1_13_1","unstructured":"Gabriel Carroll. 2021. Contract Theory. (2021)."},{"key":"e_1_3_2_1_14_1","volume-title":"Bayesian Agency: Linear versus Tractable Contracts. arXiv e-prints","author":"Castiglioni Matteo","year":"2021","unstructured":"Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. 2021. Bayesian Agency: Linear versus Tractable Contracts. arXiv e-prints (2021), arXiv-2106."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA9987"},{"key":"e_1_3_2_1_16_1","first-page":"15265","article-title":"Learning strategy-aware linear classifiers","volume":"33","author":"Chen Yiling","year":"2020","unstructured":"Yiling Chen, Yang Liu, and Chara Podimata. 2020. Learning strategy-aware linear classifiers. Advances in Neural Information Processing Systems 33 (2020), 15265--15276.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15714-1_19"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329581"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3545946.3598695"},{"key":"e_1_3_2_1_20_1","unstructured":"Yuan Deng Jon Schneider and Balusubramanian Sivan. 2019. Strategizing against No-regret Learners. arXiv:1909.13861 [cs.GT]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219193"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897583"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00084"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329591"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2017.12.022"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0740"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/85.2.379"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20434"},{"key":"e_1_3_2_1_29_1","volume-title":"Oracle Efficient Online Multicalibration and Omniprediction. In ACM-SIAM Symposium on Discrete Algorithms.","author":"Garg Sumegha","year":"2024","unstructured":"Sumegha Garg, Christopher Jung, Omer Reingold, and Aaron Roth. 2024. Oracle Efficient Online Multicalibration and Omniprediction. In ACM-SIAM Symposium on Discrete Algorithms."},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference on Machine Learning, ICML 2023","volume":"11492","author":"Globus-Harris Ira","year":"2023","unstructured":"Ira Globus-Harris, Declan Harrison, Michael Kearns, Aaron Roth, and Jessica Sorrell. 2023. Multicalibration as Boosting for Regression. In International Conference on Machine Learning, ICML 2023, 23--29 July 2023, Honolulu, Hawaii, USA (Proceedings of Machine Learning Research, Vol. 202), Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett (Eds.). PMLR, 11459--11492. https:\/\/proceedings.mlr.press\/v202\/globus-harris23a.html"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5531-y"},{"key":"e_1_3_2_1_32_1","volume-title":"Loss Minimization Through the Lens Of Outcome Indistinguishability. In 14th Innovations in Theoretical Computer Science Conference (ITCS","author":"Gopalan Parikshit","year":"2023","unstructured":"Parikshit Gopalan, Lunjia Hu, Michael P Kim, Omer Reingold, and Udi Wieder. 2023a. Loss Minimization Through the Lens Of Outcome Indistinguishability. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.79"},{"key":"e_1_3_2_1_34_1","volume-title":"Characterizing notions of omniprediction via multicalibration. arXiv preprint arXiv:2302.06726","author":"Gopalan Parikshit","year":"2023","unstructured":"Parikshit Gopalan, Michael P Kim, and Omer Reingold. 2023b. Characterizing notions of omniprediction via multicalibration. arXiv preprint arXiv:2302.06726 (2023)."},{"key":"e_1_3_2_1_35_1","volume-title":"Foundations of Insurance Economics: Readings in Economics and Finance","author":"Grossman Sanford J","unstructured":"Sanford J Grossman and Oliver D Hart. 1992. An analysis of the principal-agent problem. In Foundations of Insurance Economics: Readings in Economics and Finance. Springer, 302--340."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538308"},{"key":"e_1_3_2_1_37_1","unstructured":"Nika Haghtalab Chara Podimata and Kunhe Yang. 2023. Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents. arXiv:2306.02704 [cs.GT]"},{"key":"e_1_3_2_1_38_1","volume-title":"International Conference on Machine Learning. PMLR","author":"H\u00e9bert-Johnson Ursula","year":"2018","unstructured":"Ursula H\u00e9bert-Johnson, Michael Kim, Omer Reingold, and Guy Rothblum. 2018. Multicalibration: Calibration for the (computationally-identifiable) masses. In International Conference on Machine Learning. PMLR, 1939--1948."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602880"},{"key":"e_1_3_2_1_40_1","volume-title":"Moral hazard and observability. The Bell journal of economics","author":"Holmstr\u00f6m Bengt","year":"1979","unstructured":"Bengt Holmstr\u00f6m. 1979. Moral hazard and observability. The Bell journal of economics (1979), 74--91."},{"key":"e_1_3_2_1_41_1","volume-title":"Aggregation and linearity in the provision of intertemporal incentives. Econometrica: Journal of the Econometric Society","author":"Holmstrom Bengt","year":"1987","unstructured":"Bengt Holmstrom and Paul Milgrom. 1987. Aggregation and linearity in the provision of intertemporal incentives. Econometrica: Journal of the Econometric Society (1987), 303--328."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.017"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.101.6.2590"},{"key":"e_1_3_2_1_44_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--28094.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884444"},{"key":"e_1_3_2_1_46_1","volume-title":"Conference on Learning Theory. PMLR, 5221--5252","author":"Mansour Yishay","year":"2022","unstructured":"Yishay Mansour, Mehryar Mohri, Jon Schneider, and Balasubramanian Sivan. 2022a. Strategizing against learners in bayesian games. In Conference on Learning Theory. PMLR, 5221--5252."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2205"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764522"},{"key":"e_1_3_2_1_49_1","volume-title":"High-Dimensional Prediction for Sequential Decision Making. arXiv preprint arXiv:2310.17651","author":"Noarov Georgy","year":"2023","unstructured":"Georgy Noarov, Ramya Ramalingam, Aaron Roth, and Stephan Xie. 2023. High-Dimensional Prediction for Sequential Decision Making. arXiv preprint arXiv:2310.17651 (2023)."},{"key":"e_1_3_2_1_50_1","volume-title":"Uncertain: Modern Topics in Uncertainty Estimation.","author":"Roth Aaron","year":"2023","unstructured":"Aaron Roth. 2023. Uncertain: Modern Topics in Uncertainty Estimation."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381527"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897579"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806883"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467549"},{"key":"e_1_3_2_1_55_1","volume-title":"Sequential information design: Markov persuasion process and its efficient reinforcement learning. arXiv preprint arXiv:2202.10678","author":"Wu Jibang","year":"2022","unstructured":"Jibang Wu, Zixuan Zhang, Zhe Feng, Zhaoran Wang, Zhuoran Yang, Michael I Jordan, and Haifeng Xu. 2022. Sequential information design: Markov persuasion process and its efficient reinforcement learning. arXiv preprint arXiv:2202.10678 (2022)."},{"key":"e_1_3_2_1_56_1","first-page":"22313","article-title":"Calibrating predictions to decisions: A novel approach to multi-class calibration","volume":"34","author":"Zhao Shengjia","year":"2021","unstructured":"Shengjia Zhao, Michael Kim, Roshni Sahoo, Tengyu Ma, and Stefano Ermon. 2021. Calibrating predictions to decisions: A novel approach to multi-class calibration. Advances in Neural Information Processing Systems 34 (2021), 22313--22324.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_57_1","volume-title":"The sample complexity of online contract design. arXiv preprint arXiv:2211.05732","author":"Zhu Banghua","year":"2022","unstructured":"Banghua Zhu, Stephen Bates, Zhuoran Yang, Yixin Wang, Jiantao Jiao, and Michael I Jordan. 2022. The sample complexity of online contract design. arXiv preprint arXiv:2211.05732 (2022)."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467593"}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA","acronym":"EC '24","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673460","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673460","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":58,"alternative-id":["10.1145\/3670865.3673460","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673460","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}