{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T02:44:41Z","timestamp":1782787481553,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:00:00Z","timestamp":1748563200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:00:00Z","timestamp":1748563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2022YFA1004600"],"award-info":[{"award-number":["2022YFA1004600"]}]},{"name":"the National Key Research and Development Program of China","award":["2022YFA1004600"],"award-info":[{"award-number":["2022YFA1004600"]}]},{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["T2293770"],"award-info":[{"award-number":["T2293770"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["T2293770"],"award-info":[{"award-number":["T2293770"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72192804"],"award-info":[{"award-number":["72192804"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s13235-025-00649-z","type":"journal-article","created":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:02:43Z","timestamp":1748581363000},"page":"825-849","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Periodicity in Hedge-Myopic System and an Asymmetric NE-Solving Paradigm for Two-Player Zero-Sum Games"],"prefix":"10.1007","volume":"16","author":[{"given":"Xinxiang","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifen","family":"Mu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoguang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,30]]},"reference":[{"issue":"1","key":"649_CR1","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 (2012) The multiplicative weights update method: a meta-algorithm and applications. Theory of computing 8(1):121\u2013164","journal-title":"Theory of computing"},{"key":"649_CR2","doi-asserted-by":"crossref","unstructured":"Bailey James P, Georgios P (2018) Multiplicative weights update in zero-sum games. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 321\u2013338","DOI":"10.1145\/3219166.3219235"},{"key":"649_CR3","volume-title":"Introduction to linear optimization","author":"B Dimitris","year":"1997","unstructured":"Dimitris B, Tsitsiklis John N (1997) Introduction to linear optimization, vol 6. Athena scientific Belmont, MA"},{"key":"649_CR4","unstructured":"Jakubi B, Thiparat C, Fryderyk F, Grzegorz K, Micha\u0142 M, Georgios P (2021) Follow-the-regularized-leader routes to chaos in routing games. In International Conference on Machine Learning, pages 925\u2013935. PMLR"},{"key":"649_CR5","doi-asserted-by":"crossref","unstructured":"Felix B, Felix F, Paul H (2010) On the rate of convergence of fictitious play. In Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings 3, pages 102\u2013113. Springer,","DOI":"10.1007\/978-3-642-16170-4_10"},{"issue":"1","key":"649_CR6","first-page":"374","volume":"13","author":"GW Brown","year":"1951","unstructured":"Brown GW (1951) Iterative solution of games by fictitious play. Act. Anal. Prod Allocation 13(1):374","journal-title":"Act. Anal. Prod Allocation"},{"key":"649_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.geb.2013.07.001","volume":"82","author":"O Candogan","year":"2013","unstructured":"Candogan O, Ozdaglar A, Parrilo PA (2013) Dynamics in near-potential games. Games and Economic Behavior 82:66\u201390","journal-title":"Games and Economic Behavior"},{"key":"649_CR8","volume-title":"Prediction, learning, and games","author":"C-B Nicolo","year":"2006","unstructured":"Nicolo C-B, G\u00e1bor L (2006) Prediction, learning, and games. Cambridge University Press"},{"key":"649_CR9","doi-asserted-by":"crossref","unstructured":"Hongcheng D, Yifen M (2022) The optimal strategy against fictitious play in infinitely repeated games. In 2022 41st Chinese Control Conference (CCC), pages 6852\u20136857. IEEE","DOI":"10.23919\/CCC55666.2022.9902863"},{"issue":"8","key":"649_CR10","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1109\/TAC.2018.2797217","volume":"63","author":"S Rasoul Etesami","year":"2018","unstructured":"Rasoul Etesami S, Saad W, Mandayam NB, Vincent Poor H (2018) Stochastic games for the smart grid energy management with prospect prosumers. IEEE Transactions on Automatic Control 63(8):2327\u20132342","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"649_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. Journal of computer and system sciences 55(1):119\u2013139","journal-title":"Journal of computer and system sciences"},{"key":"649_CR12","unstructured":"Drew F, Levine David K (1998) The theory of learning in games, volume\u00a02. MIT press,"},{"key":"649_CR13","unstructured":"Xinxiang G, Yifen M (2023) The optimal strategy against hedge algorithm in repeated games. arXiv preprint\u00a0 arXiv:2312.09472"},{"key":"649_CR14","doi-asserted-by":"crossref","unstructured":"Xinxiang G, Yifen M (2023) Taking myopic best response against the hedge algorithm. In 2023 42nd Chinese Control Conference (CCC), pages 8154\u20138158. IEEE,","DOI":"10.23919\/CCC58697.2023.10240896"},{"issue":"5","key":"649_CR15","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S Hart","year":"2000","unstructured":"Hart S, Mas-Colell A (2000) A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5):1127\u20131150","journal-title":"Econometrica"},{"key":"649_CR16","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/BF02409754","volume":"34","author":"J Hofbauer","year":"1996","unstructured":"Hofbauer J (1996) Evolutionary dynamics for bimatrix games: A hamiltonian system? Journal of mathematical biology 34:675\u2013688","journal-title":"Journal of mathematical biology"},{"issue":"1","key":"649_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.3934\/dcdsb.2006.6.215","volume":"6","author":"J Hofbauer","year":"2006","unstructured":"Hofbauer J, Sorin S (2006) Best response dynamics for continuous zero-sum games. Discrete and Continuous Dynamical Systems Series B 6(1):215","journal-title":"Discrete and Continuous Dynamical Systems Series B"},{"issue":"2","key":"649_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1287\/moor.1080.0359","volume":"34","author":"J Hofbauer","year":"2009","unstructured":"Hofbauer J, Sorin S, Viossat Y (2009) Time average replicator and best-reply dynamics. Mathematics of Operations Research 34(2):263\u2013269","journal-title":"Mathematics of Operations Research"},{"key":"649_CR19","doi-asserted-by":"crossref","unstructured":"Narendra K (1984) A new polynomial-time algorithm for linear programming. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 302\u2013311","DOI":"10.1145\/800057.808695"},{"key":"649_CR20","unstructured":"Kai L, Wenhan H, Chenchen L, Xiaotie D (June 2023) Exploiting a no-regret opponent in repeated zero-sum games. J. Shanghai Jiatong Univ."},{"key":"649_CR21","unstructured":"Tengyuan L, James S (2019) Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 907\u2013915. PMLR"},{"issue":"2","key":"649_CR22","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"L Nick","year":"1994","unstructured":"Nick L, Warmuth Manfred K (1994) The weighted majority algorithm. Information and computation 108(2):212\u2013261","journal-title":"Information and computation"},{"key":"649_CR23","doi-asserted-by":"crossref","unstructured":"Panayotis M, Christos P, Georgios P (2018) Cycles in adversarial regularized learning. In Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms, pages 2703\u20132717. SIAM","DOI":"10.1137\/1.9781611975031.172"},{"key":"649_CR24","unstructured":"Koichi M (1961) On the convergence of the learning process in a 2 x 2 non-zero-sum two-person game. Princeton University Princeton"},{"issue":"4","key":"649_CR25","doi-asserted-by":"publisher","first-page":"3230","DOI":"10.1137\/19M127375X","volume":"30","author":"M Aryan","year":"2020","unstructured":"Aryan M, Ozdaglar Asuman E, Sarath P (2020) Convergence rate of o(1\/k) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems. SIAM Journal on Optimization 30(4):3230\u20133251","journal-title":"SIAM Journal on Optimization"},{"key":"649_CR26","unstructured":"Gerasimos P, Ioannis P, Georgios P (2017) Multiplicative weights update with constant step-size in congestion games: Convergence, limit cycles and chaos. Advances in Neural Information Processing Systems, 30"},{"key":"649_CR27","unstructured":"Christos P, Georgios P (2016) From nash equilibria to chlockhart2019computingain recurrent sets: Solution concepts and topology. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pages 227\u2013235"},{"key":"649_CR28","unstructured":"Julien P, Remi M, Jean-Baptiste L, Shayegan O, Mark R, Pedro O, Neil B, Thomas A, David B, De Vylder Bart, et al (2021) From poincar\u00e9 recurrence to convergence in imperfect information games: Finding equilibrium via regularization. In International Conference on Machine Learning, pages 8525\u20138535. PMLR"},{"key":"649_CR29","doi-asserted-by":"crossref","unstructured":"Georgios P, Shamma Jeff S (2014) Optimization despite chaos: Convex relaxations to complex limit sets via poincar\u00e9 recurrence. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 861\u2013873. SIAM","DOI":"10.1137\/1.9781611973402.64"},{"key":"649_CR30","doi-asserted-by":"crossref","unstructured":"Georgios P, Carlos N-G, Christensen Henrik I, Shamma Jeff S (2014) Persistent patterns: multi-agent learning beyond equilibrium and utility. In AAMAS, pages 181\u2013188","DOI":"10.65109\/LFBS3162"},{"key":"649_CR31","doi-asserted-by":"crossref","unstructured":"Julia R (1951) An iterative method of solving a game. Annals of mathematics pages 296\u2013301","DOI":"10.2307\/1969530"},{"issue":"2","key":"649_CR32","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0022-0531(92)90041-F","volume":"57","author":"L Samuelson","year":"1992","unstructured":"Samuelson L, Zhang J (1992) Evolutionary stability in asymmetric games. Journal of economic theory 57(2):363\u2013391","journal-title":"Journal of economic theory"},{"issue":"7","key":"649_CR33","doi-asserted-by":"publisher","first-page":"4748","DOI":"10.1073\/pnas.032086299","volume":"99","author":"Y Sato","year":"2002","unstructured":"Sato Y, Akiyama E, Doyne Farmer J (2002) Chaos in learning a simple two-person game. Proceedings of the National Academy of Sciences 99(7):4748\u20134751","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"649_CR34","unstructured":"Vasilis S, Alekh A, Haipeng L, Schapire Robert E (2015) Fast convergence of regularized learning in games. Advances in Neural Information Processing Systems 28"},{"key":"649_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s40505-014-0062-4","volume":"3","author":"Y Viossat","year":"2015","unstructured":"Viossat Y (2015) Evolutionary dynamics and dominated strategies. Economic Theory Bulletin 3:91\u2013113","journal-title":"Economic Theory Bulletin"},{"key":"649_CR36","unstructured":"John VN, Oskar M (2007) Theory of games and economic behavior (60th Anniversary, Commemorative. Princeton University Press"},{"key":"649_CR37","unstructured":"Martin Z, Michael J, Michael B, Carmelo P (2007) Regret minimization in games with incomplete information. Advances in neural information processing systems 20"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-025-00649-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-025-00649-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-025-00649-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T02:16:34Z","timestamp":1782785794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-025-00649-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,30]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s13235-025-00649-z","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"value":"2153-0785","type":"print"},{"value":"2153-0793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,30]]},"assertion":[{"value":"28 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"it is not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statements"}},{"value":"it is not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"it is not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}}]}}