{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:44:39Z","timestamp":1772041479679,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"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":["CCF-2045128"],"award-info":[{"award-number":["CCF-2045128"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","award":["ASSET Grant"],"award-info":[{"award-number":["ASSET Grant"]}],"id":[{"id":"10.13039\/100008536","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.3673517","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"490-510","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Pareto-Optimal Algorithms for Learning in Games"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2988-2491","authenticated-orcid":false,"given":"Eshwar Ram","family":"Arunachaleswaran","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2584-7728","authenticated-orcid":false,"given":"Natalie","family":"Collina","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5392-3560","authenticated-orcid":false,"given":"Jon","family":"Schneider","sequence":"additional","affiliation":[{"name":"Google Research, New York, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. In ACM Symposium on Theory of Computing.","author":"Anagnostides Ioannis","year":"2022","unstructured":"Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, and Tuomas Sandholm. 2022a. Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. In ACM Symposium on Theory of Computing."},{"key":"e_1_3_2_1_2_1","volume-title":"On Last-Iterate Convergence Beyond Zero-Sum Games. In International Conference on Machine Learning.","author":"Anagnostides Ioannis","year":"2022","unstructured":"Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, and Tuomas Sandholm. 2022b. On Last-Iterate Convergence Beyond Zero-Sum Games. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_3_1","unstructured":"Eshwar Ram Arunachaleswaran Natalie Collina and Jon Schneider. 2024. Pareto-Optimal Algorithms for Learning in Games. arXiv:2402.09549"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764478"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"David Blackwell. 1956. An analog of the minimax theorem for vector payoffs. (1956).","DOI":"10.2140\/pjm.1956.6.1"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219233"},{"key":"e_1_3_2_1_8_1","volume-title":"Thirty-seventh Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=jR2FkqW6GB","author":"Brown William","year":"2023","unstructured":"William Brown, Jon Schneider, and Kiran Vodrahalli. 2023. Is Learning in Games Good for the Learners?. In Thirty-seventh Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=jR2FkqW6GB"},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Web and Internet Economics. Springer, 113--129","author":"Cai Linda","year":"2023","unstructured":"Linda Cai, S Matthew Weinberg, Evan Wildenhain, and Shirley Zhang. 2023. Selling to multiple no-regret buyers. In International Conference on Web and Internet Economics. Springer, 113--129."},{"key":"e_1_3_2_1_10_1","volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_11_1","volume-title":"Persuading a Behavioral Agent: Approximately Best Responding and Learning. arXiv preprint arXiv:2302.03719","author":"Chen Yiling","year":"2023","unstructured":"Yiling Chen and Tao Lin. 2023. Persuading a Behavioral Agent: Approximately Best Responding and Learning. arXiv preprint arXiv:2302.03719 (2023)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3545946.3598695"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134717"},{"key":"e_1_3_2_1_14_1","volume-title":"From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces. arXiv preprint arXiv:2310.19786","author":"Dagan Yuval","year":"2023","unstructured":"Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich. 2023. From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces. arXiv preprint arXiv:2310.19786 (2023)."},{"key":"e_1_3_2_1_15_1","volume-title":"Prior-free dynamic auctions with low regret buyers. Advances in Neural Information Processing Systems 32","author":"Deng Yuan","year":"2019","unstructured":"Yuan Deng, Jon Schneider, and Balasubramanian Sivan. 2019a. Prior-free dynamic auctions with low regret buyers. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_16_1","volume-title":"Strategizing against no-regret learners. Advances in Neural Information Processing Systems 32","author":"Deng Yuan","year":"2019","unstructured":"Yuan Deng, Jon Schneider, and Balasubramanian Sivan. 2019b. Strategizing against no-regret learners. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_17_1","unstructured":"Gabriele Farina Ioannis Anagnostides Haipeng Luo Chung-Wei Lee Christian Kroer and Tuomas Sandholm. 2022. Near-Optimal No-Regret Learning Dynamics for General Convex Games. In Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0595"},{"key":"e_1_3_2_1_19_1","volume-title":"The theory of learning in games","author":"Fudenberg Drew","unstructured":"Drew Fudenberg and David K Levine. 1998. The theory of learning in games. Vol. 2. MIT press."},{"key":"e_1_3_2_1_20_1","volume-title":"Contracting with a Learning Agent. arXiv preprint arXiv:2401.16198","author":"Guruganesh Guru","year":"2024","unstructured":"Guru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Joshua R Wang, and S Matthew Weinberg. 2024. Contracting with a Learning Agent. arXiv preprint arXiv:2401.16198 (2024)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538308"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_23_1","volume-title":"10 the convex optimization approach to regret minimization. Optimization for machine learning","author":"Hazan Elad","year":"2012","unstructured":"Elad Hazan. 2012. 10 the convex optimization approach to regret minimization. Optimization for machine learning (2012), 287."},{"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","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. 2022b. 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_26_1","doi-asserted-by":"publisher","unstructured":"Niklas Lauffer Mahsa Ghasemi Abolfazl Hashemi Yagiz Savas and Ufuk Topcu. 2022. No-Regret Learning in Dynamic Stackelberg Games. 10.48550\/ARXIV.2202.04786","DOI":"10.48550\/ARXIV.2202.04786"},{"key":"e_1_3_2_1_27_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. 2022. Strategizing against learners in bayesian games. In Conference on Learning Theory. PMLR, 5221--5252."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems -","volume":"2","author":"Marecki Janusz","year":"2012","unstructured":"Janusz Marecki, Gerry Tesauro, and Richard Segal. 2012. Playing Repeated Stackelberg Games with Unknown Opponents. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (Valencia, Spain) (AAMAS '12). International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 821--828."},{"key":"e_1_3_2_1_29_1","volume-title":"Fast swap regret minimization and applications to approximate correlated equilibria. arXiv preprint arXiv:2310.19647","author":"Peng Binghui","year":"2023","unstructured":"Binghui Peng and Aviad Rubinstein. 2023. Fast swap regret minimization and applications to approximate correlated equilibria. arXiv preprint arXiv:2310.19647 (2023)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012149"},{"key":"e_1_3_2_1_31_1","first-page":"22258","article-title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","volume":"35","author":"Piliouras Georgios","year":"2022","unstructured":"Georgios Piliouras, Ryann Sim, and Stratis Skoulakis. 2022. Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update. Advances in Neural Information Processing Systems 35 (2022), 22258--22269.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_32_1","volume-title":"Fast convergence of regularized learning in games. Advances in Neural Information Processing Systems 28","author":"Syrgkanis Vasilis","year":"2015","unstructured":"Vasilis Syrgkanis, Alekh Agarwal, Haipeng Luo, and Robert E Schapire. 2015. Fast convergence of regularized learning in games. Advances in Neural Information Processing Systems 28 (2015)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"H Peyton Young. 2004. Strategic learning and its limits. OUP Oxford.","DOI":"10.1093\/acprof:oso\/9780199269181.001.0001"},{"key":"e_1_3_2_1_34_1","volume-title":"Thirty-seventh Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=yw1v4RqvPk","author":"Zhang Brian Hu","year":"2023","unstructured":"Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, and Tuomas Sandholm. 2023. Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. In Thirty-seventh Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=yw1v4RqvPk"}],"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.3673517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673517","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673517","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.3673517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":34,"alternative-id":["10.1145\/3670865.3673517","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673517","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"}}]}}