{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:17:26Z","timestamp":1743081446170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157134"},{"type":"electronic","value":"9783031157141"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_22","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"383-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Convergence of\u00a0Optimistic Gradient Ascent in\u00a0Network Zero-Sum Extensive Form Games"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Piliouras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lillian","family":"Ratliff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryann","family":"Sim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Skoulakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jet.2016.09.010","volume":"166","author":"I Arieli","year":"2016","unstructured":"Arieli, I., Babichenko, Y.: Random extensive form games. J. Econ. Theory 166, 517\u2013535 (2016)","journal-title":"J. Econ. Theory"},{"issue":"6374","key":"22_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1126\/science.aao1733","volume":"359","author":"N Brown","year":"2018","unstructured":"Brown, N., Sandholm, T.: Superhuman AI for heads-up no-limit poker: libratus beats top professionals. Science 359(6374), 418\u2013424 (2018)","journal-title":"Science"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1287\/moor.2015.0745","volume":"41","author":"Y Cai","year":"2016","unstructured":"Cai, Y., Candogan, O., Daskalakis, C., Papadimitriou, C.H.: Zero-sum polymatrix games: a generalization of minmax. Math. Oper. Res. 41(2), 648\u2013655 (2016)","journal-title":"Math. Oper. Res."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 217\u2013234. SIAM (2011)","DOI":"10.1137\/1.9781611973082.20"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-02930-1_35","volume-title":"Automata, Languages and Programming","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Papadimitriou, C.H.: On a network generalization of the minmax theorem. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 423\u2013434. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_35"},{"key":"22_CR6","unstructured":"Farina, G., Kroer, C., Sandholm, T.: Optimistic regret minimization for extensive-form games via dilated distance-generating functions. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"22_CR7","unstructured":"Hazan, E.: Introduction to online convex optimization. CoRR abs\/1909.05207 (2019). http:\/\/arxiv.org\/abs\/1909.05207"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/moor.1100.0452","volume":"35","author":"S Hoda","year":"2010","unstructured":"Hoda, S., Gilpin, A., Pe\u00f1a, J., Sandholm, T.: Smoothing techniques for computing nash equilibria of sequential games. Math. Oper. Res. 35(2), 494\u2013512 (2010)","journal-title":"Math. Oper. Res."},{"key":"22_CR9","unstructured":"Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. arXiv preprint arXiv:1301.2281 (2013)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"22_CR11","unstructured":"Kroer, C., Farina, G., Sandholm, T.: Solving large sequential games with the excessive gap technique. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: Simplified two-person poker. In: Contributions to the Theory of Games, vol. 1, pp. 97\u2013103 (1950)","DOI":"10.1515\/9781400881727-010"},{"key":"22_CR13","volume-title":"Contributions to the Theory of Games","author":"HW Kuhn","year":"1953","unstructured":"Kuhn, H.W., Tucker, A.W.: Contributions to the Theory of Games, vol. 2. Princeton University Press, Princeton (1953)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Kuhn, H.: Extensive form games. In: Proceedings of National Academy of Science, pp. 570\u2013576 (1950)","DOI":"10.1073\/pnas.36.10.570"},{"key":"22_CR15","unstructured":"Lanctot, M., Waugh, K., Zinkevich, M., Bowling, M.: Monte Carlo sampling for regret minimization in extensive games. In: Advances in Neural Information Processing Systems, vol. 22 (2009)"},{"key":"22_CR16","first-page":"14293","volume":"34","author":"CW Lee","year":"2021","unstructured":"Lee, C.W., Kroer, C., Luo, H.: Last-iterate convergence in extensive-form games. Adv. Neural. Inf. Process. Syst. 34, 14293\u201314305 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"103653","DOI":"10.1016\/j.artint.2021.103653","volume":"304","author":"S Leonardos","year":"2022","unstructured":"Leonardos, S., Piliouras, G.: Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory. Artif. Intell. 304, 103653 (2022)","journal-title":"Artif. Intell."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mertikopoulos, P., Papadimitriou, C., Piliouras, G.: Cycles in adversarial regularized learning. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2703\u20132717. SIAM (2018)","DOI":"10.1137\/1.9781611975031.172"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"key":"22_CR20","unstructured":"Palaiopanos, G., Panageas, I., Piliouras, G.: Multiplicative weights update with constant step-size in congestion games: convergence, limit cycles and chaos. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"22_CR21","unstructured":"Perolat, J., et al.: From poincar\u00e9 recurrence to convergence in imperfect information games: finding equilibrium via regularization. In: International Conference on Machine Learning, pp. 8525\u20138535. PMLR (2021)"},{"key":"22_CR22","unstructured":"Rakhlin, A., Sridharan, K.: Online learning with predictable sequences. In: Conference on Learning Theory, pp. 993\u20131019. PMLR (2013)"},{"key":"22_CR23","unstructured":"Rowland, M., et al.: Multiagent evaluation under incomplete information. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"22_CR24","unstructured":"Selten, R.: Spieltheoretische behandlung eines oligopolmodells mit nachfragetr\u00e4gheit: Teil i: Bestimmung des dynamischen preisgleichgewichts. Zeitschrift f\u00fcr die gesamte Staatswissenschaft\/J. Inst. Theor. Econ. 301\u2013324 (1965)"},{"key":"22_CR25","unstructured":"Tammelin, O., Burch, N., Johanson, M., Bowling, M.: Solving heads-up limit Texas Hold\u2019em. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"22_CR26","unstructured":"Wei, C.Y., Lee, C.W., Zhang, M., Luo, H.: Linear last-iterate convergence in constrained saddle-point optimization. In: International Conference on Learning Representations (2020)"},{"key":"22_CR27","unstructured":"Wei, C.Y., Lee, C.W., Zhang, M., Luo, H.: Last-iterate convergence of decentralized optimistic gradient descent\/ascent in infinite-horizon competitive Markov games. In: Conference on Learning Theory, pp. 4259\u20134299. PMLR (2021)"},{"key":"22_CR28","unstructured":"Yang, Y., Wang, J.: An overview of multi-agent reinforcement learning from game theoretical perspective. arXiv preprint arXiv:2011.00583 (2020)"},{"key":"22_CR29","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems, vol. 20 (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15714-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:29:34Z","timestamp":1663090174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.01","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}