{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:20:46Z","timestamp":1743088846393,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_12","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"205-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Swim till\u00a0You Sink: Computing the\u00a0Limit of\u00a0a\u00a0Game"],"prefix":"10.1007","author":[{"given":"Rashida","family":"Hakim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Milionis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Piliouras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"12_CR1","unstructured":"Andrade, G.P., Frongillo, R., Piliouras, G.: Learning in matrix games can be arbitrarily complex. In: Conference on Learning Theory, pp. 159\u2013185. PMLR (2021)"},{"key":"12_CR2","unstructured":"Andrade, G.P., Frongillo, R., Piliouras, G.: No-regret learning in games is Turing complete. In: ACM Conference on Economics and Computation (EC) (2023)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2012.06.004","volume":"76","author":"Y Babichenko","year":"2012","unstructured":"Babichenko, Y.: Completely uncoupled dynamics and Nash equilibria. Games Econ. Behav. 76(1), 1\u201314 (2012)","journal-title":"Games Econ. Behav."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, J.P., Piliouras, G.: Multiplicative weights update in zero-sum games. In: ACM Conference on Economics and Computation (2018)","DOI":"10.1145\/3219166.3219235"},{"key":"12_CR6","unstructured":"Bielawski, J., Chotibut, T., Falniowski, F., Kosiorowski, G., Misiurewicz, M., Piliouras, G.: Follow-the-regularized-leader routes to chaos in routing games. In: International Conference on Machine Learning, pp. 925\u2013935. PMLR (2021)"},{"key":"12_CR7","unstructured":"Biggar, O., Shames, I.: The attractor of the replicator dynamic in zero-sum games. arXiv preprint arXiv:2302.00253 (2023)"},{"key":"12_CR8","unstructured":"Biggar, O., Shames, I.: The replicator dynamic, chain components and the response graph. In: Agrawal, S., Orabona, F. (eds.) Proceedings of the 34th International Conference on Algorithmic Learning Theory. Proceedings of Machine Learning Research, vol.\u00a0201, pp. 237\u2013258. PMLR (2023). https:\/\/proceedings.mlr.press\/v201\/biggar23a.html"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Meierhans, S., Gutenberg, M.P.: Almost-linear time algorithms for incremental graphs: cycle detection, SCCs, $$ s $$-$$ t $$ shortest path, and minimum-cost flow. arXiv preprint arXiv:2311.18295 (2023)","DOI":"10.1145\/3618260.3649745"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.H.: Computing Nash equilibria: approximation and smoothed complexity. In: FOCS 2006, pp. 603\u2013612. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.20"},{"key":"12_CR11","unstructured":"Cheung, Y.K., Piliouras, G.: Online optimization in games via control theory: connecting regret, passivity and poincar\u00e9 recurrence. In: International Conference on Machine Learning, pp. 1855\u20131865. PMLR (2021)"},{"key":"12_CR12","unstructured":"Chotibut, T., Falniowski, F., Misiurewicz, M., Piliouras, G.: The route to chaos in routing games: when is price of anarchy too optimistic? In: Advances in Neural Information Processing Systems, vol. 33, pp. 766\u2013777 (2020)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., et al.: Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 410\u2013419 (2017)","DOI":"10.1145\/3055399.3055463"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Conley, C.: Isolated Invariant Sets and the Morse Index. No.\u00a038 in Regional Conference Series in Mathematics. American Mathematical Society, Providence (1978)","DOI":"10.1090\/cbms\/038"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-16170-4_11","volume-title":"Algorithmic Game Theory","author":"C Daskalakis","year":"2010","unstructured":"Daskalakis, C., Frongillo, R., Papadimitriou, C.H., Pierrakos, G., Valiant, G.: On learning algorithms for Nash equilibria. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 114\u2013125. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16170-4_11"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: STOC 2006, pp. 71\u201378. ACM (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. In: FOCS 2007, pp. 113\u2013123. IEEE Computer Society (2007)","DOI":"10.1109\/FOCS.2007.39"},{"key":"12_CR18","unstructured":"Fabrikant, A., Papadimitriou, C.: The complexity of game dynamics: BGP oscillations, sink equlibria, and beyond. In: SODA (2008). http:\/\/www.cs.berkeley.edu\/~alexf\/papers\/fp08.pdf"},{"key":"12_CR19","unstructured":"Fabrikant, A., Papadimitriou, C.H.: The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In: SODA, vol.\u00a08, pp. 844\u2013853. Citeseer (2008)"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1073\/pnas.1109672110","volume":"110","author":"T Galla","year":"2013","unstructured":"Galla, T., Farmer, J.D.: Complex dynamics in learning complicated games. Proc. Natl. Acad. Sci. 110(4), 1232\u20131236 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Goemans, M., Mirrokni, V., Vetta, A.: Sink equilibria and convergence. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 142\u2013151 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.68","DOI":"10.1109\/SFCS.2005.68"},{"key":"12_CR22","unstructured":"Hakim, R., Milionis, J., Papadimitriou, C., Piliouras, G.: Swim till you sink: computing the limit of a game (2024). https:\/\/jasonmili.github.io\/files\/gd_hittingprobabilities.pdf"},{"key":"12_CR23","volume-title":"A General Theory of Equilibrium Selection in Games","author":"JC Harsanyi","year":"1992","unstructured":"Harsanyi, J.C., Selten, R.: A General Theory of Equilibrium Selection in Games, 2nd edn. MIT Press, Cambridge (1992)","edition":"2"},{"issue":"5","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1257\/000282803322655581","volume":"93","author":"S Hart","year":"2003","unstructured":"Hart, S., Mas-Colell, A.: Uncoupled dynamics do not lead to Nash equilibrium. Am. Econ. Rev. 93(5), 1830\u20131836 (2003)","journal-title":"Am. Econ. Rev."},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1137\/0405030","volume":"5","author":"R Hassin","year":"1992","unstructured":"Hassin, R., Haviv, M.: Mean passage times and nearly uncoupled Markov chains. SIAM J. Discrete Math. 5(3), 386\u2013397 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR26","unstructured":"Hsieh, Y.P., Mertikopoulos, P., Cevher, V.: The limits of min-max optimization algorithms: convergence to spurious non-critical sets. arXiv preprint arXiv:2006.09065 (2020)"},{"key":"12_CR27","unstructured":"Kleinberg, R., Ligett, K., Piliouras, G., Tardos, \u00c9.: Beyond the Nash equilibrium barrier. In: Symposium on Innovations in Computer Science (ICS) (2011)"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-031-47751-5_20","volume-title":"Financial Cryptography and Data Security","author":"S Leonardos","year":"2023","unstructured":"Leonardos, S., Reijsbergen, D., Monnot, B., Piliouras, G.: Optimality despite chaos in fee markets. In: Baldimtsi, F., Cachin, C. (eds.) FC 2023. LNCS, vol. 13951, pp. 346\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47751-5_20"},{"key":"12_CR30","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":"12_CR31","doi-asserted-by":"publisher","unstructured":"Milionis, J., Papadimitriou, C., Piliouras, G., Spendlove, K.: An impossibility theorem in game dynamics. Proc. Natl. Acad. Sci. 120(41), e2305349120 (2023). https:\/\/doi.org\/10.1073\/pnas.2305349120. https:\/\/www.pnas.org\/doi\/abs\/10.1073\/pnas.2305349120","DOI":"10.1073\/pnas.2305349120"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Skopalik, A.: On the complexity of Nash dynamics and sink equilibria. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 1\u201310 (2009)","DOI":"10.1145\/1566374.1566376"},{"key":"12_CR33","unstructured":"Muller, P., et al.: A generalized training approach for multiagent learning. arXiv preprint arXiv:1909.12823 (2019)"},{"issue":"1","key":"12_CR34","doi-asserted-by":"publisher","first-page":"9937","DOI":"10.1038\/s41598-019-45619-9","volume":"9","author":"S Omidshafiei","year":"2019","unstructured":"Omidshafiei, S., et al.: $$\\alpha $$-rank: multi-agent evaluation by evolution. Sci. Rep. 9(1), 9937 (2019)","journal-title":"Sci. Rep."},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"5603","DOI":"10.1038\/s41467-020-19244-4","volume":"11","author":"S Omidshafiei","year":"2020","unstructured":"Omidshafiei, S., et al.: Navigating the landscape of multiplayer games. Nat. Commun. 11(1), 5603 (2020)","journal-title":"Nat. Commun."},{"key":"12_CR36","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, pp. 5872\u20135882 (2017)"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Pangallo, M., Sanders, J., Galla, T., Farmer, D.: A taxonomy of learning dynamics in $$2 \\times 2$$ games. arXiv e-prints arXiv:1701.09043 (2017)","DOI":"10.2139\/ssrn.2913183"},{"issue":"10","key":"12_CR38","doi-asserted-by":"publisher","first-page":"782","DOI":"10.3390\/e20100782","volume":"20","author":"C Papadimitriou","year":"2018","unstructured":"Papadimitriou, C., Piliouras, G.: From Nash equilibria to chain recurrent sets: an algorithmic solution concept for game theory. Entropy 20(10), 782 (2018)","journal-title":"Entropy"},{"issue":"2","key":"12_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/3331041.3331048","volume":"16","author":"C Papadimitriou","year":"2019","unstructured":"Papadimitriou, C., Piliouras, G.: Game dynamics as the meaning of a game. ACM SIGecom Exchanges 16(2), 53\u201363 (2019)","journal-title":"ACM SIGecom Exchanges"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Peyton Young, H.: The evolution of conventions. Econometrica 61(1), 57\u201384 (1993). http:\/\/www.jstor.org\/stable\/2951778","DOI":"10.2307\/2951778"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Piliouras, G., Yu, F.Y.: Multi-agent performative prediction: from global stability and optimality to chaos. In: Proceedings of the 24th ACM Conference on Economics and Computation, pp. 1047\u20131074 (2023)","DOI":"10.1145\/3580507.3597759"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"12_CR43","unstructured":"Rowland, M., et al.: Multiagent evaluation under incomplete information. arXiv preprint arXiv:1909.09849 (2019)"},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-22013-5","volume":"8","author":"JB Sanders","year":"2018","unstructured":"Sanders, J.B., Farmer, J.D., Galla, T.: The prevalence of chaotic dynamics in games with many players. Sci. Rep. 8(1), 1\u201313 (2018)","journal-title":"Sci. Rep."},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Sato, Y., Akiyama, E., Farmer, J.D.: Chaos in learning a simple two-person game. Proc. Natl. Acad. Sci. 99(7), 4748\u20134751 (2002). https:\/\/doi.org\/10.1073\/pnas.032086299. https:\/\/www.pnas.org\/content\/99\/7\/4748","DOI":"10.1073\/pnas.032086299"},{"key":"12_CR46","doi-asserted-by":"publisher","unstructured":"Schuster, P., Sigmund, K.: Replicator dynamics. J. Theor. Biol. 100(3), 533\u2013538 (1983). https:\/\/doi.org\/10.1016\/0022-5193(83)90445-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0022519383904459","DOI":"10.1016\/0022-5193(83)90445-9"},{"key":"12_CR47","doi-asserted-by":"publisher","unstructured":"Taylor, P.D., Jonker, L.B.: Evolutionary stable strategies and game dynamics. Math. Biosci. 40(1), 145\u2013156 (1978). https:\/\/doi.org\/10.1016\/0025-5564(78)90077-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0025556478900779","DOI":"10.1016\/0025-5564(78)90077-9"},{"key":"12_CR48","unstructured":"Vlatakis-Gkaragkounis, E.V., Flokas, L., Lianeas, T., Mertikopoulos, P., Piliouras, G.: No-regret learning and mixed Nash equilibria: they do not mix. In: Advances in Neural Information Processing Systems, vol. 33, pp. 1380\u20131391 (2020)"},{"issue":"7","key":"12_CR49","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.artint.2006.10.015","volume":"171","author":"HP Young","year":"2007","unstructured":"Young, H.P.: The possible and the impossible in multi-agent learning. Artif. Intell. 171(7), 429\u2013433 (2007)","journal-title":"Artif. Intell."}],"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-71033-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:04:18Z","timestamp":1725321858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}