{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:53:56Z","timestamp":1783439636670,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520031","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"736-749","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games"],"prefix":"10.1145","author":[{"given":"Ioannis","family":"Anagnostides","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constantinos","family":"Daskalakis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriele","family":"Farina","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxwell","family":"Fishelson","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noah","family":"Golowich","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Jacob Abernethy Peter L Bartlett and Elad Hazan. 2011. Blackwell Approachability and No-Regret Learning are Equivalent.. In COLT. 27\u201346.  Jacob Abernethy Peter L Bartlett and Elad Hazan. 2011. Blackwell Approachability and No-Regret Learning are Equivalent.. In COLT. 27\u201346."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7152(89)90016-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(74)90037-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055407"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1314498.1314543"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aao1733"},{"key":"e_1_3_2_1_8_1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley Arthur","year":"1889","unstructured":"Arthur Cayley . 1889 . A theorem on trees . Quart. J. Math. , 23 (1889), 376 \u2013 378 . Arthur Cayley. 1889. A theorem on trees. Quart. J. Math., 23 (1889), 376\u2013378.","journal-title":"Quart. J. Math."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Chen Xi","year":"2020","unstructured":"Xi Chen and Binghui Peng . 2020 . Hedging in games: Faster convergence of external and swap regrets . In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS). Xi Chen and Binghui Peng. 2020. Hedging in games: Faster convergence of external and swap regrets. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.21"},{"key":"e_1_3_2_1_13_1","first-page":"27604","article-title":"Near-Optimal No-Regret Learning in General Games","author":"Daskalakis Constantinos","year":"2021","unstructured":"Constantinos Daskalakis , Maxwell Fishelson , and Noah Golowich . 2021 . Near-Optimal No-Regret Learning in General Games . In Advances in Neural Information Processing Systems. 34, Curran Associates, Inc. , 27604 \u2013 27616 . Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich. 2021. Near-Optimal No-Regret Learning in General Games. In Advances in Neural Information Processing Systems. 34, Curran Associates, Inc., 27604\u201327616.","journal-title":"Advances in Neural Information Processing Systems. 34, Curran Associates, Inc."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_15_1","volume-title":"Training GANs with Optimism. In 6th International Conference on Learning Representations, ICLR","author":"Daskalakis Constantinos","year":"2018","unstructured":"Constantinos Daskalakis , Andrew Ilyas , Vasilis Syrgkanis , and Haoyang Zeng . 2018 . Training GANs with Optimism. In 6th International Conference on Learning Representations, ICLR 2018. OpenReview.net. Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng. 2018. Training GANs with Optimism. In 6th International Conference on Learning Representations, ICLR 2018. OpenReview.net."},{"key":"e_1_3_2_1_16_1","volume-title":"NeurIPS","author":"Daskalakis Constantinos","year":"2018","unstructured":"Constantinos Daskalakis and Ioannis Panageas . 2018. The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization . In NeurIPS 2018 . 9256\u20139266. Constantinos Daskalakis and Ioannis Panageas. 2018. The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. In NeurIPS 2018. 9256\u20139266."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.27"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"e_1_3_2_1_19_1","volume-title":"Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. CoRR, abs\/2104.01520","author":"Farina Gabriele","year":"2021","unstructured":"Gabriele Farina , Andrea Celli , Alberto Marchesi , and Nicola Gatti . 2021. Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. CoRR, abs\/2104.01520 ( 2021 ). Gabriele Farina, Andrea Celli, Alberto Marchesi, and Nicola Gatti. 2021. Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. CoRR, abs\/2104.01520 (2021)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0595"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390202"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_24_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems","author":"Ito Shinji","year":"2020","unstructured":"Shinji Ito . 2020 . A Tight Lower Bound and Efficient Reduction for Swap Regret . In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020. Shinji Ito. 2020. A Tight Lower Bound and Efficient Reduction for Swap Regret. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020."},{"key":"e_1_3_2_1_25_1","volume-title":"Wicks","author":"Kruckman Alex","year":"2010","unstructured":"Alex Kruckman , Amy Greenwald , and John R . Wicks . 2010 . An elementary proof of the Markov chain tree theorem. Brown University . Alex Kruckman, Amy Greenwald, and John R. Wicks. 2010. An elementary proof of the Markov chain tree theorem. Brown University."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam6960"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_31_1","volume-title":"Online Learning with Predictable Sequences. In Conference on Learning Theory. 993\u20131019","author":"Rakhlin Alexander","year":"2013","unstructured":"Alexander Rakhlin and Karthik Sridharan . 2013 . Online Learning with Predictable Sequences. In Conference on Learning Theory. 993\u20131019 . Alexander Rakhlin and Karthik Sridharan. 2013. Online Learning with Predictable Sequences. In Conference on Learning Theory. 993\u20131019."},{"key":"e_1_3_2_1_32_1","unstructured":"Alexander Rakhlin and Karthik Sridharan. 2013. Optimization learning and games with predictable sequences. In Advances in Neural Information Processing Systems. 3066\u20133074.  Alexander Rakhlin and Karthik Sridharan. 2013. Optimization learning and games with predictable sequences. In Advances in Neural Information Processing Systems. 3066\u20133074."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969530"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806883"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.35"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-0465-4"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.04.007"},{"key":"e_1_3_2_1_39_1","unstructured":"Vasilis Syrgkanis Alekh Agarwal Haipeng Luo and Robert E Schapire. 2015. Fast convergence of regularized learning in games. In Advances in Neural Information Processing Systems. 2989\u20132997.  Vasilis Syrgkanis Alekh Agarwal Haipeng Luo and Robert E Schapire. 2015. Fast convergence of regularized learning in games. In Advances in Neural Information Processing Systems. 2989\u20132997."},{"key":"e_1_3_2_1_40_1","unstructured":"Chen-Yu Wei Chung-Wei Lee Mengxiao Zhang and Haipeng Luo. 2021. Linear Last-iterate Convergence in Constrained Saddle-point Optimization. In ICLR. OpenReview.net.  Chen-Yu Wei Chung-Wei Lee Mengxiao Zhang and Haipeng Luo. 2021. Linear Last-iterate Convergence in Constrained Saddle-point Optimization. In ICLR. OpenReview.net."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":40,"alternative-id":["10.1145\/3519935.3520031","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520031","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}