{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:19Z","timestamp":1751516239353,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742575","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"478-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Play Against Unknown Opponents"],"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, USA"}]},{"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 City, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Is Knowledge Power? On the (Im) possibility of Learning from Strategic Interaction. arXiv preprint arXiv:2408.08272","author":"Ananthakrishnan Nivasini","year":"2024","unstructured":"Nivasini Ananthakrishnan, Nika Haghtalab, Chara Podimata, and Kunhe Yang. 2024. Is Knowledge Power? On the (Im) possibility of Learning from Strategic Interaction. arXiv preprint arXiv:2408.08272 (2024)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673517"},{"key":"e_1_3_2_1_3_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_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","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_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219233"},{"key":"e_1_3_2_1_7_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_8_1","volume-title":"International Conference on Web and Internet Economics. Springer, 113\u2013129","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\u2013129."},{"key":"e_1_3_2_1_9_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_10_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_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3545946.3598695"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134717"},{"key":"e_1_3_2_1_13_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_14_1","volume-title":"Efficient learning and computation of linear correlated equilibrium in general convex games. arXiv preprint arXiv:2412.20291","author":"Daskalakis Constantinos","year":"2024","unstructured":"Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Charilaos Pipis, and Jon Schneider. 2024. Efficient learning and computation of linear correlated equilibrium in general convex games. arXiv preprint arXiv:2412.20291 (2024)."},{"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","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0595"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/238061.238163"},{"key":"e_1_3_2_1_19_1","volume-title":"Robust no-regret learning in min-max Stackelberg games. arXiv preprint arXiv:2203.14126","author":"Goktas Denizalp","year":"2022","unstructured":"Denizalp Goktas, Jiayi Zhao, and Amy Greenwald. 2022. Robust no-regret learning in min-max Stackelberg games. arXiv preprint arXiv:2203.14126 (2022)."},{"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","volume-title":"Calibrated stackelberg games: Learning optimal commitments against calibrated agents. Advances in Neural Information Processing Systems 36","author":"Haghtalab Nika","year":"2024","unstructured":"Nika Haghtalab, Chara Podimata, and Kunhe Yang. 2024. Calibrated stackelberg games: Learning optimal commitments against calibrated agents. Advances in Neural Information Processing Systems 36 (2024)."},{"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":"The Economic Journal 45, 178","author":"Hicks J. R.","year":"1935","unstructured":"J. R. Hicks. 1935. The Economic Journal 45, 178 (1935), 334\u2013336. http:\/\/www.jstor.org\/stable\/2224643"},{"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\u201328094.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_26_1","volume-title":"Conference On Learning Theory. PMLR, 1292\u20131294","author":"Lee Yin Tat","year":"2018","unstructured":"Yin Tat Lee, Aaron Sidford, and Santosh S Vempala. 2018. Efficient convex optimization with membership oracles. In Conference On Learning Theory. PMLR, 1292\u20131294."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_23"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.03.008"},{"key":"e_1_3_2_1_29_1","volume-title":"Conference on Learning Theory. PMLR, 5221\u20135252","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\u20135252."},{"key":"e_1_3_2_1_30_1","unstructured":"Praveen Paruchuri Jonathan P Pearce Janusz Marecki Milind Tambe Fernando Ordonez and Sarit Kraus. 2008. Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications."},{"key":"e_1_3_2_1_31_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_32_1","volume-title":"International Conference on Machine Learning. PMLR, 42304\u201342316","author":"Zhao Geng","year":"2023","unstructured":"Geng Zhao, Banghua Zhu, Jiantao Jiao, and Michael Jordan. 2023. Online learning in stackelberg games with an omniscient follower. In International Conference on Machine Learning. PMLR, 42304\u201342316."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9295"}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:50:11Z","timestamp":1751482211000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":33,"alternative-id":["10.1145\/3736252.3742575","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742575","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}