{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:15:48Z","timestamp":1774541748249,"version":"3.50.1"},"reference-count":311,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T00:00:00Z","timestamp":1707004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T00:00:00Z","timestamp":1707004800000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11432-022-3777-y","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T04:12:42Z","timestamp":1708315962000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A survey of decision making in adversarial games"],"prefix":"10.1007","volume":"67","author":[{"given":"Xiuxian","family":"Li","sequence":"first","affiliation":[]},{"given":"Min","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Yiguang","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,4]]},"reference":[{"key":"3777_CR1","volume-title":"Theory of Games and Economic Behavior","author":"J von Neumann","year":"1947","unstructured":"von Neumann J, Morgenstern O. Theory of Games and Economic Behavior. 2nd ed. Princeton: Princeton University Press, 1947","edition":"2nd ed."},{"key":"3777_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J F Nash","year":"1950","unstructured":"Nash J F. Equilibrium points in n-person games. Proc Natl Acad Sci USA, 1950, 36: 48\u201349","journal-title":"Proc Natl Acad Sci USA"},{"key":"3777_CR3","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J. Non-cooperative games. Ann Math, 1951, 54: 286\u2013295","journal-title":"Ann Math"},{"key":"3777_CR4","volume-title":"Game Theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg D, Tirole J. Game Theory. Cambridge: MIT Press, 1991"},{"key":"3777_CR5","volume-title":"A Course in Game Theory","author":"M J Osborne","year":"1994","unstructured":"Osborne M J, Rubinstein A. A Course in Game Theory. Cambridge: MIT Press, 1994"},{"key":"3777_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44374-4","volume-title":"Handbook of Dynamic Game Theory","author":"T Ba\u015far","year":"2018","unstructured":"Ba\u015far T, Zaccour G. Handbook of Dynamic Game Theory. Berlin: Springer International Publishing, 2018"},{"key":"3777_CR7","doi-asserted-by":"publisher","first-page":"110919","DOI":"10.1016\/j.automatica.2023.110919","volume":"151","author":"M Meng","year":"2023","unstructured":"Meng M, Li X X. On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information. Automatica, 2023, 151: 110919","journal-title":"Automatica"},{"key":"3777_CR8","volume-title":"Repeated Games with Incomplete Information","author":"R J Aumann","year":"1995","unstructured":"Aumann R J, Maschler M, Stearns R E. Repeated Games with Incomplete Information. Cambridge: MIT Press, 1995"},{"key":"3777_CR9","first-page":"112","volume":"34","author":"N Bard","year":"2013","unstructured":"Bard N, Hawkin J, Rubin J, et al. The annual computer poker competition. AI Mag, 2013, 34: 112\u2013114","journal-title":"AI Mag"},{"key":"3777_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01545-8","volume-title":"Essentials of Game Theory: A Concise Multidisciplinary Introduction","author":"K Leyton-Brown","year":"2008","unstructured":"Leyton-Brown K, Shoham Y. Essentials of Game Theory: A Concise Multidisciplinary Introduction. Cham: Springer, 2008. 1\u201388"},{"key":"3777_CR11","doi-asserted-by":"crossref","unstructured":"Sinha A, Fang F, An B, et al. Stackelberg security games: looking beyond a decade of success. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, 2018. 5494\u20135501","DOI":"10.24963\/ijcai.2018\/775"},{"key":"3777_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen T H, Kar D, Brown M, et al. Towards a science of security games. In: Proceedings of the Mathematical Sciences with Multidisciplinary Applications, 2016. 347\u2013381","DOI":"10.1007\/978-3-319-31323-8_16"},{"key":"3777_CR13","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s13235-018-00291-y","volume":"9","author":"S R Etesami","year":"2019","unstructured":"Etesami S R, Basar T. Dynamic games in cyber-physical security: an overview. Dyn Games Appl, 2019, 9: 884\u2013913","journal-title":"Dyn Games Appl"},{"key":"3777_CR14","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D, Huang A, Maddison C J, et al. Mastering the game of Go with deep neural networks and tree search. Nature, 2016, 529: 484\u2013489","journal-title":"Nature"},{"key":"3777_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver D, Schrittwieser J, Simonyan K, et al. Mastering the game of Go without human knowledge. Nature, 2017, 550: 354\u2013359","journal-title":"Nature"},{"key":"3777_CR16","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver D, Hubert T, Schrittwieser J, et al. A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science, 2018, 362: 1140\u20131144","journal-title":"Science"},{"key":"3777_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1146\/annurev-economics-081919-113720","volume":"12","author":"A Aradillas-L\u00f3pez","year":"2020","unstructured":"Aradillas-L\u00f3pez A. The econometrics of static games. Annu Rev Econ, 2020, 12: 135\u2013165","journal-title":"Annu Rev Econ"},{"key":"3777_CR18","doi-asserted-by":"publisher","first-page":"2749","DOI":"10.1007\/s11831-020-09475-5","volume":"28","author":"H L Li","year":"2021","unstructured":"Li H L, Wang X, Jia F W, et al. A survey of Nash equilibrium strategy solving based on CFR. Arch Computat Methods Eng, 2021, 28: 2749\u20132760","journal-title":"Arch Computat Methods Eng"},{"key":"3777_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11831-018-9300-5","volume":"27","author":"M K Sohrabi","year":"2020","unstructured":"Sohrabi M K, Azgomi H. A survey on the combined use of optimization methods and game theory. Arch Computat Methods Eng, 2020, 27: 59\u201380","journal-title":"Arch Computat Methods Eng"},{"key":"3777_CR20","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1109\/JAS.2022.105506","volume":"9","author":"J R Wang","year":"2022","unstructured":"Wang J R, Hong Y T, Wang J L, et al. Cooperative and competitive multi-agent systems: from optimization to games. IEEE CAA J Autom Sin, 2022, 9: 763\u2013783","journal-title":"IEEE CAA J Autom Sin"},{"key":"3777_CR21","unstructured":"Li X X, Xie L H, Li N. A survey on distributed online optimization and game. 2022. ArXiv:2205.00473"},{"key":"3777_CR22","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.3390\/s22031032","volume":"22","author":"E Ho","year":"2022","unstructured":"Ho E, Rajagopalan A, Skvortsov A, et al. Game theory in defence applications: a review. Sensors, 2022, 22: 1032","journal-title":"Sensors"},{"key":"3777_CR23","doi-asserted-by":"crossref","unstructured":"Shishika D, Kumar V. A review of multi-agent perimeter defense games. In: Proceedings of the International Conference on Decision and Game Theory for Security, College Park, 2020. 472\u2013485","DOI":"10.1007\/978-3-030-64793-3_26"},{"key":"3777_CR24","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1109\/COMST.2021.3102874","volume":"23","author":"M Zhu","year":"2021","unstructured":"Zhu M, Anwar A H, Wan Z L, et al. A survey of defensive deception: approaches using game theory and machine learning. IEEE Commun Surv Tutorials, 2021, 23: 2460\u20132493","journal-title":"IEEE Commun Surv Tutorials"},{"key":"3777_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2019.03.018","volume":"282","author":"D R Insua","year":"2020","unstructured":"Insua D R, Ruggeri F, Soyer R, et al. Advances in Bayesian decision making in reliability. Eur J Operational Res, 2020, 282: 1\u201318","journal-title":"Eur J Operational Res"},{"key":"3777_CR26","unstructured":"Lanctot M, Zambaldi V, Gruslys A, et al. A unified game-theoretic approach to multiagent reinforcement learning. In: Proceedings of the Advances in Neural Information Processing Systems, Long Beach, 2017. 30"},{"key":"3777_CR27","doi-asserted-by":"crossref","unstructured":"Littman M L. Markov games as a framework for multi-agent reinforcement learning. In: Proceedings of the Machine Learning Proceedings, 1994. 157\u2013163","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"3777_CR28","doi-asserted-by":"crossref","unstructured":"Zamir S. Bayesian Games: Games With Incomplete Information. Technical Report, 2008","DOI":"10.1007\/978-0-387-30440-3_29"},{"key":"3777_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen X, Deng X T, Teng S-H. Settling the complexity of computing two-player Nash equilibria. J ACM, 2009, 56: 1\u201357","journal-title":"J ACM"},{"key":"3777_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis C, Goldberg P W, Papadimitriou C H. The complexity of computing a Nash equilibrium. SIAM J Comput, 2009, 39: 195\u2013259","journal-title":"SIAM J Comput"},{"key":"3777_CR31","doi-asserted-by":"publisher","DOI":"10.1145\/3241304","volume-title":"Hardness of Approximation Between P and NP","author":"A Rubinstein","year":"2019","unstructured":"Rubinstein A. Hardness of Approximation Between P and NP. Williston: Morgan & Claypool, 2019"},{"key":"3777_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R J Aumann","year":"1974","unstructured":"Aumann R J. Subjectivity and correlation in randomized strategies. J Math Economics, 1974, 1: 67\u201396","journal-title":"J Math Economics"},{"key":"3777_CR33","first-page":"97","volume-title":"Approximation to Bayes risk in repeated play. In: Contributions to the Theory of Games","author":"J Hannan","year":"1957","unstructured":"Hannan J. Approximation to Bayes risk in repeated play. In: Contributions to the Theory of Games. Princeton: Princeton University Press, 1957. 3: 97\u2013139"},{"key":"3777_CR34","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J V Neumann","year":"1928","unstructured":"Neumann J V. Zur theorie der gesellschaftsspiele. Math Ann, 1928, 100: 295\u2013320","journal-title":"Math Ann"},{"key":"3777_CR35","doi-asserted-by":"crossref","unstructured":"Farina G, Bianchi T, Sandholm T. Coarse correlation in extensive-form games. In: Proceedings of AAAI Conference on Artificial Intelligence, 2020. 34: 1934\u20131941","DOI":"10.1609\/aaai.v34i02.5563"},{"key":"3777_CR36","unstructured":"Celli A, Coniglio S, Gatti N. Computing optimal coarse correlated equilibria in sequential games. 2019. ArXiv:1901.06221"},{"key":"3777_CR37","doi-asserted-by":"crossref","unstructured":"Celli A, Gatti N. Computational results for extensive-form adversarial team games. In: Proceedings of the AAAI Conference on Artificial Intelligence, 2018. 32","DOI":"10.1609\/aaai.v32i1.11462"},{"key":"3777_CR38","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/game.1997.0527","volume":"21","author":"B von Stengel","year":"1997","unstructured":"von Stengel B, Koller D. Team-maxmin equilibria. Games Economic Behav, 1997, 21: 309\u2013321","journal-title":"Games Economic Behav"},{"key":"3777_CR39","doi-asserted-by":"publisher","first-page":"9937","DOI":"10.1038\/s41598-019-45619-9","volume":"9","author":"S Omidshafiei","year":"2019","unstructured":"Omidshafiei S, Papadimitriou C, Piliouras G, et al. \u03b1-rank: multi-agent evaluation by evolution. Sci Rep, 2019, 9: 9937","journal-title":"Sci Rep"},{"key":"3777_CR40","volume-title":"Marktform und Gleichgewicht","author":"H von Stackelberg","year":"1934","unstructured":"von Stackelberg H. Marktform und Gleichgewicht. Berlin: Springer-Verlag, 1934"},{"key":"3777_CR41","first-page":"400","volume":"43","author":"B An","year":"2013","unstructured":"An B, Ord\u00f3\u00f1ez F, Tambe M, et al. A deployed quantal response-based patrol planning system for the U.S. coast guard. Interfaces, 2013, 43: 400\u2013420","journal-title":"coast guard. Interfaces"},{"key":"3777_CR42","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ejor.2019.05.012","volume":"278","author":"C Casorr\u00e1n","year":"2019","unstructured":"Casorr\u00e1n C, Fortz B, Labb\u00e9 M, et al. A study of general and security Stackelberg game formulations. Eur J Operational Res, 2019, 278: 855\u2013868","journal-title":"Eur J Operational Res"},{"key":"3777_CR43","doi-asserted-by":"crossref","unstructured":"Conitzer V, Sandholm T. Computing the optimal strategy to commit to. In: Proceedings of the 7th ACM Conference on Electronic Commerce, Michigan, 2006. 82\u201390","DOI":"10.1145\/1134707.1134717"},{"key":"3777_CR44","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BF00933155","volume":"26","author":"G Leitmann","year":"1978","unstructured":"Leitmann G. On generalized Stackelberg strategies. J Optim Theor Appl, 1978, 26: 637\u2013643","journal-title":"J Optim Theor Appl"},{"key":"3777_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12586-7","volume-title":"Market Structure and Equilibrium","author":"H von Stackelberg","year":"2011","unstructured":"von Stackelberg H. Market Structure and Equilibrium. Berlin: Springer Science & Business Media, 2011"},{"key":"3777_CR46","doi-asserted-by":"crossref","unstructured":"Ba\u015far T, Olsder G J. Dynamic noncooperative game theory. In: Proceedings of Society for Industrial and Applied Mathematics, 1998","DOI":"10.1137\/1.9781611971132"},{"key":"3777_CR47","volume-title":"Differential Games","author":"R Isaacs","year":"1965","unstructured":"Isaacs R. Differential Games. New York: Wiley, 1965"},{"key":"3777_CR48","doi-asserted-by":"publisher","DOI":"10.1002\/9781118122631","volume-title":"Optimal Control","author":"F L Lewis","year":"2012","unstructured":"Lewis F L, Vrabie D, Syrmos V L. Optimal Control. Hoboken: John Wiley & Sons, 2012"},{"key":"3777_CR49","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s13235-010-0005-0","volume":"1","author":"R Buckdahn","year":"2011","unstructured":"Buckdahn R, Cardaliaguet P, Quincampoix M. Some recent aspects of differential game theory. Dyn Games Appl, 2011, 1: 74\u2013114","journal-title":"Dyn Games Appl"},{"key":"3777_CR50","volume-title":"Differential Games","author":"A Friedman","year":"2013","unstructured":"Friedman A. Differential Games. Mineola: Courier Corporation, 2013"},{"key":"3777_CR51","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10462-017-9603-1","volume":"50","author":"H Jiang","year":"2018","unstructured":"Jiang H, Zhang H G. Iterative ADP learning algorithms for discrete-time multi-player games. Artif Intell Rev, 2018, 50: 75\u201391","journal-title":"Artif Intell Rev"},{"key":"3777_CR52","doi-asserted-by":"publisher","unstructured":"Qiao J F, Li M H, Wang D. Asymmetric constrained optimal tracking control with critic learning of nonlinear multiplayer zero-sum games. IEEE Trans Neural Networks Learning Syst, 2022. doi: https:\/\/doi.org\/10.1109\/TNNLS.2022.3208611","DOI":"10.1109\/TNNLS.2022.3208611"},{"key":"3777_CR53","doi-asserted-by":"crossref","unstructured":"Liu M S, Wan Y, Lewis F L, et al. Stochastic two-player zero-sum learning differential games. In: Proceedings of the 15th International Conference on Control and Automation (ICCA), Edinburgh, 2019. 1038\u20131043","DOI":"10.1109\/ICCA.2019.8899568"},{"key":"3777_CR54","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1002\/rnc.1193","volume":"18","author":"D X Li","year":"2008","unstructured":"Li D X, Cruz J J B, Schumacher C J. Stochastic multi-player pursuit-evasion differential games. Intl J Robust Nonlinear, 2008, 18: 218\u2013247","journal-title":"Intl J Robust Nonlinear"},{"key":"3777_CR55","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2845926.2845929","volume":"14","author":"S Barman","year":"2015","unstructured":"Barman S, Ligett K. Finding any nontrivial coarse correlated equilibrium is hard. Sigecom Exch, 2015, 14: 76\u201379","journal-title":"Sigecom Exch"},{"key":"3777_CR56","doi-asserted-by":"crossref","unstructured":"Garg J, Jiang A X, Mehta R. Bilinear games: polynomial time algorithms for rank based subclasses. In: Proceedings of the International Workshop on Internet and Network Economics, Singapore, 2011. 399\u2013407","DOI":"10.1007\/978-3-642-25510-6_35"},{"key":"3777_CR57","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C E Lemke","year":"1964","unstructured":"Lemke C E, Howson J J T. Equilibrium points of bimatrix games. J Soc Industrial Appl Math, 1964, 12: 413\u2013423","journal-title":"J Soc Industrial Appl Math"},{"key":"3777_CR58","unstructured":"Anagnostides I, Penna P. Solving zero-sum games through alternating projections. 2020. ArXiv:2010.00109"},{"key":"3777_CR59","unstructured":"Dinh L C, Yang Y D, Tian Z, et al. Online double oracle. 2021. ArXiv:2103.07780"},{"key":"3777_CR60","unstructured":"Murhekar A. Approximate Nash equilibria of imitation games: algorithms and complexity. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2020. 887\u2013894"},{"key":"3777_CR61","first-page":"1304","volume":"173","author":"E Borel","year":"1921","unstructured":"Borel E. La th\u00e9orie du jeu et les \u00e9quations int\u00e9gralesa noyau sym\u00e9trique. Comptes rendus de l\u2019Acad\u00e9mie des Sciences, 1921, 173: 1304\u20131308","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"3777_CR62","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/mnsc.18.5.312","volume":"18","author":"J J T Howson","year":"1972","unstructured":"Howson J J T. Equilibria of polymatrix games. Manage Sci, 1972, 18: 312\u2013318","journal-title":"Manage Sci"},{"key":"3777_CR63","doi-asserted-by":"publisher","first-page":"665","DOI":"10.21136\/AM.2020.0371-19","volume":"65","author":"G Sengodan","year":"2020","unstructured":"Sengodan G, Arumugasamy C. Linear complementarity problems and bi-linear games. Appl Math, 2020, 65: 665\u2013675","journal-title":"Appl Math"},{"key":"3777_CR64","doi-asserted-by":"crossref","unstructured":"Deligkas A, Fasoulakis M, Markakis E. A polynomial-time algorithm for 1\/3-approximate Nash equilibria in bimatrix games. 2022. ArXiv:2204.11525","DOI":"10.1145\/3606697"},{"key":"3777_CR65","unstructured":"Deligkas A, Fearnley J, Savani R. Tree polymatrix games are PPAD-hard. 2020. ArXiv:2002.12119"},{"key":"3777_CR66","series-title":"Dissertation for Ph.D. Degree","volume-title":"Campaigning via LPs: solving blotto and beyond","author":"S Seddighin","year":"2019","unstructured":"Seddighin S. Campaigning via LPs: solving blotto and beyond. Dissertation for Ph.D. Degree. College Park: University of Maryland, 2019"},{"key":"3777_CR67","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1137\/15M1032338","volume":"47","author":"R Mehta","year":"2018","unstructured":"Mehta R. Constant rank two-player games are PPAD-hard. SIAM J Comput, 2018, 47: 1858\u20131887","journal-title":"SIAM J Comput"},{"key":"3777_CR68","doi-asserted-by":"crossref","unstructured":"Boodaghians S, Brakensiek J, Hopkins S B, et al. Smoothed complexity of 2-player Nash equilibria. In: Proceedings of the Annual Symposium on Foundations of Computer Science, 2020. 271\u2013282","DOI":"10.1109\/FOCS46700.2020.00034"},{"key":"3777_CR69","doi-asserted-by":"crossref","unstructured":"Behnezhad S, Blum A, Derakhshan M, et al. Optimal strategies of Blotto games: beyond convexity. In: Proceedings of the ACM Conference on Economics and Computation, Phoenix, 2019. 597\u2013616","DOI":"10.1145\/3328526.3329608"},{"key":"3777_CR70","doi-asserted-by":"publisher","unstructured":"Behnezhad S, Dehghani S, Derakhshan M, et al. Fast and simple solutions of Blotto games. Oper Res, 2022. doi: https:\/\/doi.org\/10.1287\/opre.2022.2261","DOI":"10.1287\/opre.2022.2261"},{"key":"3777_CR71","unstructured":"Beaglehole D. An efficient approximation algorithm for the Colonel Blotto game. 2022. ArXiv:2201.10758"},{"key":"3777_CR72","doi-asserted-by":"crossref","unstructured":"Leon V, Etesami S R. Bandit learning for dynamic Colonel Blotto game with a budget constraint. 2021. ArXiv:2103.12833","DOI":"10.1109\/CDC45484.2021.9683087"},{"key":"3777_CR73","unstructured":"Vu D Q, Loiseau P, Silva A. Approximate equilibria in generalized Colonel Blotto and generalized Lottery Blotto games. 2019. ArXiv:1910.06559"},{"key":"3777_CR74","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.geb.2021.05.002","volume":"129","author":"E Boix-Adser\u00e1","year":"2021","unstructured":"Boix-Adser\u00e1 E, Edelman B L, Jayanti S. The multiplayer Colonel Blotto game. Games Economic Behav, 2021, 129: 15\u201331","journal-title":"Games Economic Behav"},{"key":"3777_CR75","unstructured":"Vlatakis-Gkaragkounis E V, Flokas L, Piliouras G. Poincar\u00e9 recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games. In: Proceedings of the Advances in Neural Information Processing Systems, Vancouver, 2019. 1\u201312"},{"key":"3777_CR76","unstructured":"Zhang G D, Wang Y H, Lessard L, et al. Near-optimal local convergence of alternating gradient descent-ascent for minimax optimization. In: Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022, 7659\u20137679"},{"key":"3777_CR77","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/18M1213488","volume":"31","author":"E Y Hamedani","year":"2021","unstructured":"Hamedani E Y, Aybat N S. A primal-dual algorithm with line search for general convex-concave saddle point problems. SIAM J Optim, 2021, 31: 1299\u20131329","journal-title":"SIAM J Optim"},{"key":"3777_CR78","unstructured":"Tominin V, Tominin Y, Borodich E, et al. On accelerated methods for saddle-point problems with composite structure. 2021. ArXiv:2103.09344"},{"key":"3777_CR79","unstructured":"Xie G Z, Han Y Z, Zhang Z H. DIPPA: an improved method for bilinear saddle point problems. 2021. ArXiv:2103.08270"},{"key":"3777_CR80","unstructured":"Kovalev D, Gasnikov A, Richt\u00e1rik P. Accelerated primal-dual gradient method for smooth and convex-concave saddle-point problems with bilinear coupling. 2021. ArXiv:2112.15199"},{"key":"3777_CR81","unstructured":"Thekumparampil K K, He N, Oh S. Lifted primal-dual method for bilinearly coupled smooth minimax optimization. 2022. ArXiv:2201.07427"},{"key":"3777_CR82","unstructured":"Gidel G, Jebara T, Lacoste-Julien S. Frank-wolfe algorithms for saddle point problems. In: Proceedings of the International Conference on Artificial Intelligence and Statistics, 2017. 362\u2013371"},{"key":"3777_CR83","unstructured":"Chen C, Luo L, Zhang W N, et al. Efficient projection-free algorithms for saddle point problems. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 10799\u201310808"},{"key":"3777_CR84","unstructured":"Li H C, Tian Y, Zhang J Z, et al. Complexity lower bounds for nonconvex-strongly-concave min-max optimization. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 1\u201313"},{"key":"3777_CR85","unstructured":"Hsieh Y P, Mertikopoulos P, Cevher V. The limits of min-max optimization algorithms: convergence to spurious non-critical sets. In: Proceedings of the International Conference on Machine Learning, 2021. 4337\u20134348"},{"key":"3777_CR86","unstructured":"Wei C Y, Lee C W, Zhang M X, et al. Linear last-iterate convergence in constrained saddle-point optimization. In: Proceedings of the International Conference on Learning Representations, 2021. 1\u201312"},{"key":"3777_CR87","first-page":"1","volume":"23","author":"I Bistritz","year":"2022","unstructured":"Bistritz I, Zhou Z Y, Chen X, et al. No weighted-regret learning in adversarial bandits with delays. J Machine Learning Res, 2022, 23: 1\u201343","journal-title":"J Machine Learning Res"},{"key":"3777_CR88","unstructured":"Fiez T, Sim R, Skoulakis S, et al. Online learning in periodic zero-sum games. 2021. ArXiv:2111.03377"},{"key":"3777_CR89","doi-asserted-by":"crossref","unstructured":"Gao H C, Wang X Q, Luo L, et al. On the convergence of stochastic compositional gradient descent ascent method. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2021. 1\u20137","DOI":"10.24963\/ijcai.2021\/329"},{"key":"3777_CR90","unstructured":"Beznosikov A, Scutari G, Rogozin A, et al. Distributed saddle-point problems under data similarity. 2021. ArXiv:2107.10706"},{"key":"3777_CR91","unstructured":"Balduzzi D, Garnelo M, Bachrach Y, et al. Open-ended learning in symmetric zero-sum games. In: Proceedings of the International Conference on Machine Learning, 2019. 434\u2013443"},{"key":"3777_CR92","unstructured":"Vlatakis-Gkaragkounis E V, Flokas L, Piliouras G. Solving min-max optimization with hidden structure via gradient descent ascent. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34: 1\u201314"},{"key":"3777_CR93","unstructured":"Goktas D, Greenwald A. Convex-concave min-max Stackelberg games. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34"},{"key":"3777_CR94","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.geb.2014.12.001","volume":"89","author":"D Xefteris","year":"2015","unstructured":"Xefteris D. Symmetric zero-sum games with only asymmetric equilibria. Games Economic Behav, 2015, 89: 122\u2013125","journal-title":"Games Economic Behav"},{"key":"3777_CR95","doi-asserted-by":"crossref","unstructured":"Cai Y, Daskalakis C. On minmax theorems for multiplayer games. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2011. 217\u2013234","DOI":"10.1137\/1.9781611973082.20"},{"key":"3777_CR96","unstructured":"Anagnostides I, Panageas I, Farina G, et al. On last-iterate convergence beyond zero-sum games. 2022. ArXiv:2203.12056"},{"key":"3777_CR97","unstructured":"Bailey J P. o(1\/t) time-average convergence in a generalization of multiagent zero-sum games. 2021. ArXiv:2110.02482"},{"key":"3777_CR98","unstructured":"Fiez T, Sim R, Skoulakis S, et al. Online learning in periodic zero-sum games: von Neumann vs Poincaro\u00e9, 2021. ArXiv:2111.03377"},{"key":"3777_CR99","doi-asserted-by":"crossref","unstructured":"Skoulakis S, Fiez T, Sim R, et al. Evolutionary game theory squared: evolving agents in endogenously evolving zero-sum games. In: Proceedings of the AAAI Conference on Artificial Intelligence, 2021. 1\u20139","DOI":"10.1609\/aaai.v35i13.17352"},{"key":"3777_CR100","unstructured":"Hughes E, Anthony T W, Eccles T, et al. Learning to resolve alliance dilemmas in many-player zero-sum games. 2020. ArXiv:2003.00799"},{"key":"3777_CR101","unstructured":"Ganzfried S. Fast complete algorithm for multiplayer Nash equilibrium. 2020. ArXiv:2002.04734"},{"key":"3777_CR102","doi-asserted-by":"crossref","unstructured":"Anagnostides I, Daskalakis C, Farina G, et al. Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. 2021. ArXiv:2111.06008","DOI":"10.1145\/3519935.3520031"},{"key":"3777_CR103","doi-asserted-by":"crossref","unstructured":"Anagnostides I, Farina G, Kroer C, et al. Faster no-regret learning dynamics for extensive-form correlated and coarse correlated equilibria. 2022. ArXiv:2202.05446","DOI":"10.1145\/3490486.3538288"},{"key":"3777_CR104","series-title":"Dissertation for Ph.D. Degree","volume-title":"Multi-player games in the era of machine learning","author":"G Gidel","year":"2020","unstructured":"Gidel G. Multi-player games in the era of machine learning. Dissertation for Ph.D. Degree. Montreal: Universito\u00e9 de Montro\u00e9al, 2020"},{"key":"3777_CR105","unstructured":"Zhang Y Z, An B. Converging to team-maxmin equilibria in zero-sum multiplayer games. In: Proceedings of the International Conference on Machine Learning, 2020. 11033\u201311043"},{"key":"3777_CR106","unstructured":"Kalogiannis F, Vlatakis-Gkaragkounis E V, Panageas I. Teamwork makes von Neumann work: min-max optimization in two-team zero-sum games. 2021. ArXiv:2111.04178"},{"key":"3777_CR107","doi-asserted-by":"crossref","unstructured":"HansenK A, Hansen T D, Miltersen P B, et al. Approximability and parameterized complexity of minmax values. In: Proceedings of the International Workshop on Internet and Network Economics, 2008. 684\u2013695","DOI":"10.1007\/978-3-540-92185-1_74"},{"key":"3777_CR108","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2009.04.016","volume":"70","author":"C Borgs","year":"2010","unstructured":"Borgs C, Chayes J, Immorlica N, et al. The myth of the Folk Theorem. Games Economic Behav, 2010, 70: 34\u201343","journal-title":"Games Economic Behav"},{"key":"3777_CR109","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1016\/j.automatica.2013.02.062","volume":"49","author":"B Gharesifard","year":"2013","unstructured":"Gharesifard B, Corto\u00e9s J. Distributed convergence to Nash equilibria in two-network zero-sum games. Automatica, 2013, 49: 1683\u20131692","journal-title":"Automatica"},{"key":"3777_CR110","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1109\/TAC.2015.2504962","volume":"61","author":"Y C Lou","year":"2016","unstructured":"Lou Y C, Hong Y G, Xie L H, et al. Nash equilibrium computation in subnetwork zero-sum games with switching communications. IEEE Trans Automat Contr, 2016, 61: 2920\u20132935","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR111","doi-asserted-by":"crossref","unstructured":"Huang S J, Lei J L, Hong Y G, et al. No-regret distributed learning in two-network zero-sum games. In: Proceedings of the IEEE Conference on Decision and Control, Austin, 2021. 924\u2013929","DOI":"10.1109\/CDC45484.2021.9683186"},{"key":"3777_CR112","doi-asserted-by":"crossref","unstructured":"Zhang Y Z, An B. Computing team-maxmin equilibria in zero-sum multiplayer extensive-form games. In: Proceedings of AAAI Conference on Artificial Intelligence, 2020. 34: 2318\u20132325","DOI":"10.1609\/aaai.v34i02.5610"},{"key":"3777_CR113","unstructured":"Carminati L, Cacciamani F, Ciccone M, et al. Public information representation for adversarial team games. 2022. ArXiv:2201.10377"},{"key":"3777_CR114","unstructured":"Farina G, Celli A, Gatti N, et al. Faster algorithms for optimal ex-ante coordinated collusive strategies in extensive-form zero-sum games. 2020. ArXiv:2009.10061"},{"key":"3777_CR115","unstructured":"Zhang B H, Sandholm T. Team correlated equilibria in zero-sum extensive-form games via tree decompositions. 2021. ArXiv:2109.05284"},{"key":"3777_CR116","series-title":"Dissertation for Ph.D. Degree","volume-title":"Equilibrium finding for large adversarial imperfect-information games","author":"N Brown","year":"2020","unstructured":"Brown N. Equilibrium finding for large adversarial imperfect-information games. Dissertation for Ph.D. Degree. Pittsburgh: Carnegie Mellon University, 2020"},{"key":"3777_CR117","unstructured":"Tammelin O, Burch N, Johanson M, et al. Solving heads-up limit Texas Hold\u2019em. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2015. 645\u2013652"},{"key":"3777_CR118","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1126\/science.aam6960","volume":"356","author":"M Morav\u010d\u00edk","year":"2017","unstructured":"Morav\u010d\u00edk M, Schmid M, Burch N, et al. DeepStack: expert-level artificial intelligence in heads-up no-limit poker. Science, 2017, 356: 508\u2013513","journal-title":"Science"},{"key":"3777_CR119","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, 2018, 359: 418\u2013424","journal-title":"Science"},{"key":"3777_CR120","unstructured":"Munos R, Perolat J, Lespiau J B, et al. Fast computation of Nash equilibria in imperfect information games. In: Proceedings of the International Conference on Machine Learning, 2020. 7119\u20137129"},{"key":"3777_CR121","doi-asserted-by":"crossref","unstructured":"Farina G, Kroer C, Sandholm T. Better regularization for sequential decision spaces: fast convergence rates for Nash, correlated, and team equilibria. 2021. ArXiv:2105.12954","DOI":"10.1145\/3465456.3467576"},{"key":"3777_CR122","unstructured":"Brown N, Sandholm T. Safe and nested subgame solving for imperfect-information games. In: Proceedings of the Advances in Neural Information Processing Systems, 2017. 30: 1\u201311"},{"key":"3777_CR123","unstructured":"Brown N, Sandholm T, Amos B. Depth-limited solving for imperfect-information games. In: Proceedings of the Advances in Neural Information Processing Systems, 2018. 31: 1\u201312"},{"key":"3777_CR124","first-page":"3","volume":"9","author":"T A Marsland","year":"1986","unstructured":"Marsland T A. A review of game-tree pruning. J Int Comput Games Assoc, 1986, 9: 3\u201319","journal-title":"J Int Comput Games Assoc"},{"key":"3777_CR125","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1126\/science.aaa4614","volume":"347","author":"T Sandholm","year":"2015","unstructured":"Sandholm T. Solving imperfect-information games. Science, 2015, 347: 122\u2013123","journal-title":"Science"},{"key":"3777_CR126","unstructured":"Schmid M. Search in imperfect information games. 2021. ArXiv:2111.05884"},{"key":"3777_CR127","unstructured":"Kova\u0159\u00edk V, Milec D, \u0160ustr M, et al. Fast algorithms for poker require modelling it as a sequential Bayesian game. 2021. ArXiv:2112.10890"},{"key":"3777_CR128","unstructured":"Farina G, Lee C W, Luo H P, et al. Kernelized multiplicative weights for 0\/1-polyhedral games: bridging the gap between learning in extensive-form and normal-form games. 2022. ArXiv:2202.00237"},{"key":"3777_CR129","unstructured":"Meng L J, Gao Y. Generalized bandit regret minimizer framework in imperfect information extensive-form game. 2022. ArXiv:2203.05920"},{"key":"3777_CR130","unstructured":"Bai Y, Jin C, Mei S, et al. Near-optimal learning of extensive-form games with imperfect information. 2022. ArXiv:2202.01752"},{"key":"3777_CR131","unstructured":"Kozuno T, M\u00e9nard P, Munos R, et al. Model-free learning for two-player zero-sum partially observable Markov games with perfect recall. 2021. ArXiv:2106.06279"},{"key":"3777_CR132","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1126\/science.aay2400","volume":"365","author":"N Brown","year":"2019","unstructured":"Brown N, Sandholm T. Superhuman AI for multiplayer poker. Science, 2019, 365: 885\u2013890","journal-title":"Science"},{"key":"3777_CR133","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1126\/science.aay7774","volume":"365","author":"A Blair","year":"2019","unstructured":"Blair A, Saffidine A. AI surpasses humans at six-player poker. Science, 2019, 365: 864\u2013865","journal-title":"Science"},{"key":"3777_CR134","doi-asserted-by":"crossref","unstructured":"Wu B. Hierarchical macro strategy model for MOBA game AI. In: Proceedings of AAAI Conference on Artificial Intelligence, 2019. 33: 1206\u20131213","DOI":"10.1609\/aaai.v33i01.33011206"},{"key":"3777_CR135","unstructured":"Tian Y D, Gong Q C, Jiang Y. Joint policy search for multi-agent collaboration with imperfect information. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 33: 19931\u201319942"},{"key":"3777_CR136","doi-asserted-by":"crossref","unstructured":"Ganzfried S, Laughlin C, Morefield C. Parallel algorithm for Nash equilibrium in multiplayer stochastic games with application to naval strategic planning. In: Proceedings of the International Conference on Distributed Artificial Intelligence, 2020. 1\u201313","DOI":"10.1007\/978-3-030-64096-5_1"},{"key":"3777_CR137","doi-asserted-by":"crossref","unstructured":"Yuan W L, Hu Z Z, Luo J R, et al. Imperfect information game in multiplayer no-limit Texas Hold\u2019em based on mean approximation and deep CFVnet. In: Proceedings of the China Automation Congress, 2021. 2459\u20132466","DOI":"10.1109\/CAC53003.2021.9727939"},{"key":"3777_CR138","unstructured":"Heinrich J, Silver D. Deep reinforcement learning from self-play in imperfect-information games. 2016. ArXiv:1603.01121"},{"key":"3777_CR139","unstructured":"Li H, Hu K L, Zhang S H, et al. Double neural counterfactual regret minimization. In: Proceedings of the International Conference on Learning Representations, 2019. 1\u201313"},{"key":"3777_CR140","unstructured":"Farnia F, Ozdaglar A. Do GANs always have Nash equilibria? In: Proceedings of the International Conference on Machine Learning, 2020. 3029\u20133039"},{"key":"3777_CR141","unstructured":"Gruslys A, Lanctot M, Munos R, et al. The advantage regret-matching actor-critic. 2020. ArXiv:2008.12234"},{"key":"3777_CR142","unstructured":"Ye D H, Chen G B, Zhang W, et al. Towards playing full MOBA games with deep reinforcement learning. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 33: 621\u2013632"},{"key":"3777_CR143","doi-asserted-by":"crossref","unstructured":"Ye D, Liu Z, Sun M, et al. Mastering complex control in MOBA games with deep reinforcement learning. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 34: 6672\u20136679","DOI":"10.1609\/aaai.v34i04.6144"},{"key":"3777_CR144","unstructured":"Schmid M, Moravcik M, Burch M, et al. Player of games. 2021. ArXiv:2112.03178"},{"key":"3777_CR145","unstructured":"Phillips P. Reinforcement learning in two-player zero-sum simultaneous action games. 2021. ArXiv:2110.04835"},{"key":"3777_CR146","unstructured":"Fu H B, Liu W M, Wu S, et al. Actor-critic policy optimization in a large-scale imperfect-information game. In: Proceedings of the International Conference on Learning Representations, 2021. 1\u201312"},{"key":"3777_CR147","unstructured":"Wang X R, Cerny J, Li S X, et al. A unified perspective on deep equilibrium finding. 2022. ArXiv:2204.04930"},{"key":"3777_CR148","unstructured":"Feng X D, Slumbers O, Wan Z Y, et al. Neural auto-curricula in two-player zero-sum games. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34"},{"key":"3777_CR149","unstructured":"Feng X D, Slumbers O, Yang Y D, et al. Discovering multi-agent auto-curricula in two-player zero-sum games. 2021. ArXiv:2106.02745"},{"key":"3777_CR150","unstructured":"Yin Q Y, Yang J, Ni W C, et al. AI in games: techniques, challenges and opportunities. 2021. ArXiv:2111.07631"},{"key":"3777_CR151","unstructured":"Celli A, Marchesi A, Bianchi T, et al. Learning to correlate in multi-player general-sum sequential games. In: Proceedings of the Advances in Neural Information Processing Systems, 2019. 32"},{"key":"3777_CR152","unstructured":"Celli A, Marchesi A, Farina G, et al. No-regret learning dynamics for extensive-form correlated equilibrium. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 33: 7722\u20137732"},{"key":"3777_CR153","unstructured":"Song Z, Mei S, Bai Y. Sample-efficient learning of correlated equilibria in extensive-form games. 2022. ArXiv:2205.07223"},{"key":"3777_CR154","unstructured":"Wei C Y, Lee C W, Zhang M X, et al. Last-iterate convergence of decentralized optimistic gradient descent\/ascent in infinite-horizon competitive Markov games. In: Proceedings of the Annual Conference on Learning Theory, 2021. 4259\u20134299"},{"key":"3777_CR155","first-page":"165","volume":"13","author":"W C Mao","year":"2023","unstructured":"Mao W C, Ba\u015far T. Provably efficient reinforcement learning in decentralized general-sum Markov games. Dyn Games Appl, 2023, 13: 165\u2013186","journal-title":"Dyn Games Appl"},{"key":"3777_CR156","doi-asserted-by":"publisher","first-page":"8963","DOI":"10.1007\/s11042-022-12153-2","volume":"81","author":"T Hazra","year":"2022","unstructured":"Hazra T, Anjaria K. Applications of game theory in deep learning: a survey. Multimed Tools Appl, 2022, 81: 8963\u20138994","journal-title":"Multimed Tools Appl"},{"key":"3777_CR157","doi-asserted-by":"crossref","unstructured":"Erdem A, Pelillo M. Graph transduction as a non-cooperative game. In: Proceedings of the International Workshop on Graph-Based Representations in Pattern Recognition, 2011. 195\u2013204","DOI":"10.1007\/978-3-642-20844-7_20"},{"key":"3777_CR158","series-title":"Dissertation for Ph.D. Degree","volume-title":"Formulations and algorithms for general and security Stackelberg games","author":"C Casorr\u00e1n-Amilburu","year":"2017","unstructured":"Casorr\u00e1n-Amilburu C. Formulations and algorithms for general and security Stackelberg games. Dissertation for Ph.D. Degree. Bruxelles: Universit\u00e9 libre de Bruxelles; Santiago: Universidad de Chile, 2017"},{"key":"3777_CR159","series-title":"Dissertation for Master\u2019s Degree","volume-title":"Benders decomposition based algorithms for general and security Stackelberg games","author":"I A A Fritz","year":"2021","unstructured":"Fritz I A A. Benders decomposition based algorithms for general and security Stackelberg games. Dissertation for Master\u2019s Degree. Santiago: Universidad de Chile, 2021"},{"key":"3777_CR160","volume-title":"Bilevel Optimization: Theory, Algorithms and Applications, Volume 3","author":"S Dempe","year":"2018","unstructured":"Dempe S. Bilevel Optimization: Theory, Algorithms and Applications, Volume 3. Freiberg: TU Bergakademie Freiberg, 2018"},{"key":"3777_CR161","first-page":"125","volume":"22","author":"T Li","year":"2017","unstructured":"Li T, Sethi S P. A review of dynamic Stackelberg game models. Discret Contin Dynam Syst-B, 2017, 22: 125\u2013159","journal-title":"Discret Contin Dynam Syst-B"},{"key":"3777_CR162","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TSG.2012.2223766","volume":"4","author":"S Maharjan","year":"2013","unstructured":"Maharjan S, Zhu Q, Zhang Y, et al. Dependable demand response management in the smart grid: a Stackelberg game approach. IEEE Trans Smart Grid, 2013, 4: 120\u2013132","journal-title":"IEEE Trans Smart Grid"},{"key":"3777_CR163","first-page":"879","volume":"7","author":"M Yu","year":"2015","unstructured":"Yu M, Hong S H. A real-time demand-response algorithm for smart grids: a Stackelberg game approach. IEEE Trans Smart Grid, 2015, 7: 879\u2013888","journal-title":"IEEE Trans Smart Grid"},{"key":"3777_CR164","doi-asserted-by":"publisher","first-page":"4038","DOI":"10.1109\/TWC.2013.071913121570","volume":"12","author":"D J Yang","year":"2013","unstructured":"Yang D J, Xue G L, Zhang J, et al. Coping with a smart jammer in wireless networks: a Stackelberg game approach. IEEE Trans Wireless Commun, 2013, 12: 4038\u20134047","journal-title":"IEEE Trans Wireless Commun"},{"key":"3777_CR165","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ejor.2021.12.015","volume":"302","author":"C Guzm\u00e1n","year":"2022","unstructured":"Guzm\u00e1n C, Riffo J, Telha C, et al. A sequential Stackelberg game for dynamic inspection problems. Eur J Operational Res, 2022, 302: 727\u2013739","journal-title":"Eur J Operational Res"},{"key":"3777_CR166","doi-asserted-by":"publisher","first-page":"4396","DOI":"10.1109\/JIOT.2021.3103855","volume":"9","author":"Y N Jiang","year":"2022","unstructured":"Jiang Y N, Zhong Y, Ge X H. IIoT data sharing based on blockchain: a multileader multifollower Stackelberg game approach. IEEE Internet Things J, 2022, 9: 4396\u20134410","journal-title":"IEEE Internet Things J"},{"key":"3777_CR167","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1080\/10556780903448052","volume":"25","author":"S Leyffer","year":"2010","unstructured":"Leyffer S, Munson T. Solving multi-leader-common-follower games. Optimization Methods Software, 2010, 25: 601\u2013623","journal-title":"Optimization Methods Software"},{"key":"3777_CR168","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TWC.2016.2623603","volume":"16","author":"H Q Zhang","year":"2017","unstructured":"Zhang H Q, Xiao Y, Cai L X, et al. A multi-leader multi-follower Stackelberg game for resource management in LTE unlicensed. IEEE Trans Wireless Commun, 2017, 16: 348\u2013361","journal-title":"IEEE Trans Wireless Commun"},{"key":"3777_CR169","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/g8030025","volume":"8","author":"L Mallozzi","year":"2017","unstructured":"Mallozzi L, Messalli R. Multi-leader multi-follower model with aggregative uncertainty. Games, 2017, 8: 25","journal-title":"Games"},{"key":"3777_CR170","doi-asserted-by":"publisher","first-page":"8886","DOI":"10.1109\/TVT.2020.2996966","volume":"69","author":"T D Tran","year":"2020","unstructured":"Tran T D, Le L B. Resource allocation for multi-tenant network slicing: a multi-leader multi-follower Stackelberg game approach. IEEE Trans Veh Technol, 2020, 69: 8886\u20138899","journal-title":"IEEE Trans Veh Technol"},{"key":"3777_CR171","doi-asserted-by":"publisher","first-page":"103549","DOI":"10.1016\/j.artint.2021.103549","volume":"300","author":"M Castiglioni","year":"2021","unstructured":"Castiglioni M, Marchesi A, Gatti N. Committing to correlated strategies with multiple leaders. Artif Intelligence, 2021, 300: 103549","journal-title":"Artif Intelligence"},{"key":"3777_CR172","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.artint.2010.07.002","volume":"174","author":"J Pita","year":"2010","unstructured":"Pita J, Jain M, Tambe M, et al. Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition. Artif Intelligence, 2010, 174: 1142\u20131171","journal-title":"Artif Intelligence"},{"key":"3777_CR173","unstructured":"Bai Y, Jin C, Wang H, et al. Sample-efficient learning of Stackelberg equilibria in general-sum games. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34"},{"key":"3777_CR174","doi-asserted-by":"crossref","unstructured":"Korzhyk D, Conitzer V, Parr R. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: Proceedings of the AAAI Conference on Artificial Intelligence, Georgia, 2010. 805\u2013810","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"3777_CR175","unstructured":"Kiekintveld C, Jain M, Tsai J, et al. Computing optimal randomized resource allocations for massive security games. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, Budapest, 2009. 689\u2013696"},{"key":"3777_CR176","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/inte.1100.0505","volume":"40","author":"M Jain","year":"2010","unstructured":"Jain M, Tsai J, Pita J, et al. Software assistants for randomized patrol planning for the LAX airport police and the federal air marshal service. Interfaces, 2010, 40: 267\u2013290","journal-title":"Interfaces"},{"key":"3777_CR177","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2994501.2994507","volume":"15","author":"F Fang","year":"2016","unstructured":"Fang F, Nguyen T H. Green security games: apply game theory to addressing green security challenges. SIGecom Exch, 2016, 15: 78\u201383","journal-title":"SIGecom Exch"},{"key":"3777_CR178","doi-asserted-by":"crossref","unstructured":"Brown M, Sinha A, Schlenker A, et al. One size does not fit all: a game-theoretic approach for dynamically and effectively screening for threats. In: Proceedings of the AAAI Conference on Artificial Intelligence, Arizona, 2016. 30","DOI":"10.1609\/aaai.v30i1.10023"},{"key":"3777_CR179","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3390\/g7030015","volume":"7","author":"C Zhang","year":"2016","unstructured":"Zhang C, Gholami S, Kar D, et al. Keeping pace with criminals: an extended study of designing patrol allocation against adaptive opportunistic criminals. Games, 2016, 7: 15","journal-title":"Games"},{"key":"3777_CR180","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55692-1","volume-title":"Adversary-Aware Learning Techniques and Trends in Cybersecurity","author":"P Dasgupta","year":"2021","unstructured":"Dasgupta P, Collins J B, Mittu R. Adversary-Aware Learning Techniques and Trends in Cybersecurity. Berlin: Springer, 2021"},{"key":"3777_CR181","unstructured":"Galinkin E. Information security games: a survey. 2021. ArXiv:2103.12520"},{"key":"3777_CR182","doi-asserted-by":"crossref","unstructured":"Bucarey V, Casorr\u00e1n C, Figueroa O, et al. Building real Stackelberg security games for border patrols. In: Proceedings of the International Conference on Decision and Game Theory for Security, Vienna, 2017. 193\u2013212","DOI":"10.1007\/978-3-319-68711-7_11"},{"key":"3777_CR183","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.ejor.2019.11.002","volume":"291","author":"V Bucarey","year":"2021","unstructured":"Bucarey V, Casorr\u00e1n C, Labb\u00e9 M, et al. Coordinating resources in Stackelberg security games. Eur J Operational Res, 2021, 291: 846\u2013861","journal-title":"Eur J Operational Res"},{"key":"3777_CR184","unstructured":"Lou J, Vorobeychik Y. Equilibrium analysis of multi-defender security games. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Buenos Aires, 2015. 596\u2013602"},{"key":"3777_CR185","doi-asserted-by":"crossref","unstructured":"Mutzari D, Aumann Y, Kraus S. Robust solutions for multi-defender Stackelberg security games. 2022. ArXiv:2204.14000","DOI":"10.24963\/ijcai.2022\/62"},{"key":"3777_CR186","unstructured":"Li Y Q, Conitzer V, Korzhyk D. Catcher-evader games. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), New York, 2016. 329\u2013337"},{"key":"3777_CR187","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1007\/s10489-018-1307-y","volume":"49","author":"B R Wang","year":"2019","unstructured":"Wang B R, Zhang Y, Zhou Z-H, et al. On repeated Stackelberg security game with the cooperative human behavior model for wildlife protection. Appl Intell, 2019, 49: 1002\u20131015","journal-title":"Appl Intell"},{"key":"3777_CR188","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/int.22288","volume":"36","author":"W J Ma","year":"2021","unstructured":"Ma W J, Liu W, McAreavey K, et al. A decision support framework for security resource allocation under ambiguity. Int J Intell Syst, 2021, 36: 5\u201352","journal-title":"Int J Intell Syst"},{"key":"3777_CR189","unstructured":"Fiez T, Chasnov B, Ratliff L J. Convergence of learning dynamics in Stackelberg games. 2019. ArXiv:1906.01217"},{"key":"3777_CR190","doi-asserted-by":"publisher","first-page":"3379","DOI":"10.1109\/TAC.2015.2423891","volume":"60","author":"A A Kulkarni","year":"2015","unstructured":"Kulkarni A A, Shanbhag U V. An existence result for hierarchical Stackelberg v\/s Stackelberg games. IEEE Trans Automat Contr, 2015, 60: 3379\u20133384","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR191","unstructured":"Goktas D, Zhao J Y, Greenwald A. Robust no-regret learning in min-max Stackelberg games. 2022. ArXiv:2203.14126"},{"key":"3777_CR192","series-title":"Dissertation for Master\u2019s Degree","volume-title":"Dealing with partial information in follower\u2019s behavior identification","author":"M Maffioli","year":"2019","unstructured":"Maffioli M. Dealing with partial information in follower\u2019s behavior identification. Dissertation for Master\u2019s Degree. Milano: Politecnico di Milano, 2019"},{"key":"3777_CR193","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIFS.2022.3155294","volume":"17","author":"Z Y Cheng","year":"2022","unstructured":"Cheng Z Y, Chen G P, Hong Y G. Single-leader-multiple-followers Stackelberg security game with hypergame framework. IEEE Trans Inform Forensic Secur, 2022, 17: 954\u2013969","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"3777_CR194","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1613\/jair.1.12542","volume":"72","author":"G Birmpas","year":"2021","unstructured":"Birmpas G, Gan J R, Hollender A, et al. Optimally deceiving a learning leader in Stackelberg games. J Artif Intell Res, 2021, 72: 507\u2013531","journal-title":"J Artif Intell Res"},{"key":"3777_CR195","doi-asserted-by":"crossref","unstructured":"Sinha A. AI and security: a game perspective. In: Proceedings of the International Conference on Communication Systems & Networks (COMSNETS), Bangalore, 2022. 393\u2013396","DOI":"10.1109\/COMSNETS53615.2022.9668430"},{"key":"3777_CR196","doi-asserted-by":"crossref","unstructured":"Ding N N, Fang Z X, Duan L J, et al. Incentive mechanism design for distributed coded machine learning. In: Proceedings of the IEEE Conference on Computer Communications, Vancouver, 2021. 1\u201310","DOI":"10.1109\/INFOCOM42981.2021.9488672"},{"key":"3777_CR197","doi-asserted-by":"crossref","unstructured":"Cheng C, Zhu Z Q, Xin B, et al. A multi-agent reinforcement learning algorithm based on Stackelberg game. In: Proceedings of the Data Driven Control and Learning Systems, 2017. 727\u2013732","DOI":"10.1109\/DDCLS.2017.8068163"},{"key":"3777_CR198","unstructured":"Rajeswaran A, Mordatch I, Kumar V. A game theoretic framework for model based reinforcement learning. In: Proceedings of the International Conference on Machine Learning, 2020. 7953\u20137963"},{"key":"3777_CR199","unstructured":"Zheng L Y, Fiez T, Alumbaugh Z, et al. Stackelberg actor-critic: a game-theoretic perspective. In: Proceedings of the AAAI Workshop on Reinforcement Learning and Games, 2021. 1\u20139"},{"key":"3777_CR200","doi-asserted-by":"crossref","unstructured":"Huang P D, Xu M D, Fang F, et al. Robust reinforcement learning as a Stackelberg game via adaptively-regularized adversarial training. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2022. 3099\u20133106","DOI":"10.24963\/ijcai.2022\/430"},{"key":"3777_CR201","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-247X(71)90185-5","volume":"33","author":"D L Lukes","year":"1971","unstructured":"Lukes D L, Russell D L. A global theory for linear-quadratic differential games. J Math Anal Appl, 1971, 33: 96\u2013123","journal-title":"J Math Anal Appl"},{"key":"3777_CR202","doi-asserted-by":"crossref","unstructured":"Engwerda J. Linear quadratic differential games: an overview. In: Proceedings of the Advances in Dynamic Games and Their Applications, 2009. 1\u201334","DOI":"10.1007\/978-0-8176-4834-3_3"},{"key":"3777_CR203","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1142\/S0219198908002060","volume":"10","author":"J Shinar","year":"2008","unstructured":"Shinar J, Turetsky V, Glizer V Y, et al. Solvability of linear-quadratic differential games associated with pursuit-evasion problems. Int Game Theor Rev, 2008, 10: 481\u2013515","journal-title":"Int Game Theor Rev"},{"key":"3777_CR204","doi-asserted-by":"crossref","unstructured":"Weintraub I E, Pachter M, Garcia E. An introduction to pursuit-evasion differential games. In: Proceedings of the American Control Conference (ACC), Denver, 2020. 1049\u20131066","DOI":"10.23919\/ACC45564.2020.9147205"},{"key":"3777_CR205","doi-asserted-by":"publisher","first-page":"66","DOI":"10.3390\/axioms10020066","volume":"10","author":"A Gibali","year":"2021","unstructured":"Gibali A, Kelis O. An analytic and numerical investigation of a differential game. Axioms, 2021, 10: 66","journal-title":"Axioms"},{"key":"3777_CR206","doi-asserted-by":"crossref","unstructured":"Huang Y H, Chen J T, Zhu Q Y. Defending an asset with partial information and selected observations: a differential game framework. In: Proceedings of IEEE Conference on Decision and Control (CDC), Austin, 2021. 2366\u20132373","DOI":"10.1109\/CDC45484.2021.9683431"},{"key":"3777_CR207","unstructured":"Huang Y H, Zhu Q Y. A pursuit-evasion differential game with strategic information acquisition. 2021. ArXiv:2102.05469"},{"key":"3777_CR208","doi-asserted-by":"crossref","unstructured":"Li X, Shi J T, Yong J M. Mean-field linear-quadratic stochastic differential games in an infinite horizon. 2020. ArXiv:2007.06130","DOI":"10.1051\/cocv\/2021078"},{"key":"3777_CR209","doi-asserted-by":"crossref","unstructured":"Garcia E, Casbeer D W, Pachter M, et al. A two-team linear quadratic differential game of defending a target. In: Proceedings of American Control Conference (ACC), Denver, 2020. 1665\u20131670","DOI":"10.23919\/ACC45564.2020.9147665"},{"key":"3777_CR210","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.neucom.2017.02.051","volume":"242","author":"R Z Song","year":"2017","unstructured":"Song R Z, Wei Q L, Song B. Neural-network-based synchronous iteration learning method for multi-player zero-sum games. Neurocomputing, 2017, 242: 73\u201382","journal-title":"Neurocomputing"},{"key":"3777_CR211","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.automatica.2010.10.033","volume":"47","author":"H G Zhang","year":"2011","unstructured":"Zhang H G, Wei Q L, Liu D R. An iterative adaptive dynamic programming method for solving a class of nonlinear zero-sum differential games. Automatica, 2011, 47: 207\u2013214","journal-title":"Automatica"},{"key":"3777_CR212","doi-asserted-by":"publisher","first-page":"4009","DOI":"10.1109\/TSMC.2019.2897379","volume":"50","author":"R Z Song","year":"2020","unstructured":"Song R Z, Li J S, Lewis F L. Robust optimal control for disturbed nonlinear zero-sum differential games based on single NN and least squares. IEEE Trans Syst Man Cybern Syst, 2020, 50: 4009\u20134019","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"3777_CR213","first-page":"535","volume":"8","author":"N Y Lukoyanov","year":"2003","unstructured":"Lukoyanov N Y. Functional Hamilton-Jacobi type equations with ci-derivatives in control problems with hereditary information. Nonlinear Funct Anal Appl, 2003, 8: 535\u2013555","journal-title":"Nonlinear Funct Anal Appl"},{"key":"3777_CR214","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ifacol.2019.12.220","volume":"52","author":"A Plaksin","year":"2019","unstructured":"Plaksin A. On Hamilton-Jacobi-Bellman-Isaacs equation for time-delay systems. IFAC-PapersOnLine, 2019, 52: 138\u2013143","journal-title":"IFAC-PapersOnLine"},{"key":"3777_CR215","unstructured":"Meng W J, Shi J T. A linear quadratic stochastic Stackelberg differential game with time delay. 2021. ArXiv:2012.14145"},{"key":"3777_CR216","doi-asserted-by":"publisher","first-page":"3185","DOI":"10.1137\/19M1279368","volume":"58","author":"M I Gomoyunov","year":"2020","unstructured":"Gomoyunov M I. Dynamic programming principle and Hamilton-Jacobi-Bellman equations for fractional-order systems. SIAM J Control Optim, 2020, 58: 3185\u20133211","journal-title":"SIAM J Control Optim"},{"key":"3777_CR217","unstructured":"Moon J, Basar T. Zero-sum differential games on the Wasserstein space. 2019. ArXiv:1912.06084"},{"key":"3777_CR218","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/acs.2349","volume":"28","author":"D R Liu","year":"2014","unstructured":"Liu D R, Wei Q L. Multiperson zero-sum differential games for a class of uncertain nonlinear systems. Int J Adaptive Control Signal Process, 2014, 28: 205\u2013231","journal-title":"Int J Adaptive Control Signal Process"},{"key":"3777_CR219","doi-asserted-by":"crossref","unstructured":"Fridovich-Keil D, Ratner E, Peters L, et al. Efficient iterative linear-quadratic approximations for nonlinear multi-player general-sum differential games. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Paris, 2020. 1475\u20131481","DOI":"10.1109\/ICRA40945.2020.9197129"},{"key":"3777_CR220","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1109\/TAC.2020.3003840","volume":"66","author":"E Garcia","year":"2021","unstructured":"Garcia E, Casbeer D W, von Moll A, et al. Multiple pursuer multiple evader differential games. IEEE Trans Automat Contr, 2021, 66: 2345\u20132350","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR221","doi-asserted-by":"publisher","first-page":"4939","DOI":"10.1109\/TAC.2022.3168430","volume":"67","author":"Y H Xu","year":"2022","unstructured":"Xu Y H, Yang H, Jiang B, et al. Multiplayer pursuit-evasion differential games with malicious pursuers. IEEE Trans Automat Contr, 2022, 67: 4939\u20134946","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR222","doi-asserted-by":"publisher","first-page":"4257","DOI":"10.1109\/LRA.2020.2994023","volume":"5","author":"E Garcia","year":"2020","unstructured":"Garcia E, Casbeer D W, Pachter M. Optimal strategies for a class of multi-player reach-avoid differential games in 3D space. IEEE Robot Autom Lett, 2020, 5: 4257\u20134264","journal-title":"IEEE Robot Autom Lett"},{"key":"3777_CR223","doi-asserted-by":"publisher","first-page":"110207","DOI":"10.1016\/j.automatica.2022.110207","volume":"140","author":"R Yan","year":"2022","unstructured":"Yan R, Duan X M, Shi Z Y, et al. Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games. Automatica, 2022, 140: 110207","journal-title":"Automatica"},{"key":"3777_CR224","doi-asserted-by":"crossref","unstructured":"Shi J T, Wang G C. A linear-quadratic Stackelberg differential game with mixed deterministic and stochastic controls. 2020. ArXiv:2004.00653","DOI":"10.1051\/cocv\/2020006"},{"key":"3777_CR225","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11135-018-0742-5","volume":"53","author":"A E M A Megahed","year":"2019","unstructured":"Megahed A E M A. The Stackelberg differential game for counter-terrorism. Qual Quant, 2019, 53: 207\u2013220","journal-title":"Qual Quant"},{"key":"3777_CR226","unstructured":"Lee D G, Tomlin C J. Hamilton-Jacobi equations for two classes of state-constrained zero-sum games. 2021. ArXiv:2106.15006"},{"key":"3777_CR227","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0319033","volume":"19","author":"R J Elliott","year":"1981","unstructured":"Elliott R J, Davis M H A. Optimal play in a stochastic differential game. SIAM J Control Optim, 1981, 19: 543\u2013554","journal-title":"SIAM J Control Optim"},{"key":"3777_CR228","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1109\/TAC.2018.2846048","volume":"64","author":"J Moon","year":"2019","unstructured":"Moon J, Duncan T E, Basar T. Risk-sensitive zero-sum differential games. IEEE Trans Automat Contr, 2019, 64: 1503\u20131518","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR229","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1137\/20M1340368","volume":"59","author":"J Sun","year":"2021","unstructured":"Sun J. Two-person zero-sum stochastic linear-quadratic differential games. SIAM J Control Optim, 2021, 59: 1804\u20131829","journal-title":"SIAM J Control Optim"},{"key":"3777_CR230","unstructured":"Li J, Li W Q, Zhao H Z. On the value of a general stochastic differential game with ergodic payoff. 2021. ArXiv:2106.15894"},{"key":"3777_CR231","doi-asserted-by":"publisher","first-page":"092202","DOI":"10.1007\/s11432-016-0654-y","volume":"60","author":"J T Shi","year":"2017","unstructured":"Shi J T, Wang G C, Xiong J. Linear-quadratic stochastic Stackelberg differential game with asymmetric information. Sci China Inf Sci, 2017, 60: 092202","journal-title":"Sci China Inf Sci"},{"key":"3777_CR232","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/20M1352314","volume":"59","author":"J Moon","year":"2021","unstructured":"Moon J. Linear-quadratic stochastic Stackelberg differential games for jump-diffusion systems. SIAM J Control Optim, 2021, 59: 954\u2013976","journal-title":"SIAM J Control Optim"},{"key":"3777_CR233","unstructured":"Sun J R, Wang H X, Wen J Q. Zero-sum Stackelberg stochastic linear-quadratic differential games. 2021. ArXiv:2109.14893"},{"key":"3777_CR234","doi-asserted-by":"publisher","first-page":"3363","DOI":"10.1109\/TAC.2021.3097549","volume":"67","author":"J H Huang","year":"2022","unstructured":"Huang J H, Wang S J, Wu Z. Robust Stackelberg differential game with model uncertainty. IEEE Trans Automat Contr, 2022, 67: 3363\u20133380","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR235","doi-asserted-by":"publisher","first-page":"2510","DOI":"10.1080\/00207179.2021.1916078","volume":"95","author":"Y Y Zheng","year":"2022","unstructured":"Zheng Y Y, Shi J T. Stackelberg stochastic differential game with asymmetric noisy observations. Int J Control, 2022, 95: 2510\u20132530","journal-title":"Int J Control"},{"key":"3777_CR236","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1512\/iumj.1984.33.33040","volume":"33","author":"L C Evans","year":"1984","unstructured":"Evans L C, Souganidis P E. Differential games and representation formulas for solutions of Hamilton-Jacobi-Isaacs equations. Indiana Univ Mathem J, 1984, 33: 773\u2013797","journal-title":"Indiana Univ Mathem J"},{"key":"3777_CR237","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1051\/cocv\/2012011","volume":"19","author":"A Altarovici","year":"2013","unstructured":"Altarovici A, Bokanowski O, Zidani H. A general Hamilton-Jacobi framework for non-linear state-constrained control problems. ESAIM Contr Optim Ca, 2013, 19: 337\u2013357","journal-title":"ESAIM Contr Optim Ca"},{"key":"3777_CR238","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TAC.2005.851439","volume":"50","author":"I M Mitchell","year":"2005","unstructured":"Mitchell I M, Bayen A M, Tomlin C J. A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Trans Automat Contr, 2005, 50: 947\u2013957","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR239","doi-asserted-by":"publisher","first-page":"1849","DOI":"10.1109\/TAC.2011.2105730","volume":"56","author":"K Margellos","year":"2011","unstructured":"Margellos K, Lygeros J. Hamilton-Jacobi formulation for reach-avoid differential games. IEEE Trans Automat Contr, 2011, 56: 1849\u20131861","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR240","doi-asserted-by":"crossref","unstructured":"Fisac J F, Chen M, Tomlin C J, et al. Reach-avoid problems with time-varying dynamics, targets and constraints. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, Seattle, 2015. 11\u201320","DOI":"10.1145\/2728606.2728612"},{"key":"3777_CR241","unstructured":"Asri B E, Lalioui H. Deterministic differential games in infinite horizon involving continuous and impulse controls. 2021. ArXiv:2107.03524"},{"key":"3777_CR242","doi-asserted-by":"publisher","first-page":"109067","DOI":"10.1016\/j.automatica.2020.109067","volume":"120","author":"J Moon","year":"2020","unstructured":"Moon J. Linear-quadratic mean field stochastic zero-sum differential games. Automatica, 2020, 120: 109067","journal-title":"Automatica"},{"key":"3777_CR243","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.jde.2021.06.004","volume":"296","author":"J R Sun","year":"2021","unstructured":"Sun J R, Wang H X, Wu Z. Mean-field linear-quadratic stochastic differential games. J Differ Equ, 2021, 296: 299\u2013334","journal-title":"J Differ Equ"},{"key":"3777_CR244","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. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 2000, 68: 1127\u20131150","journal-title":"Econometrica"},{"key":"3777_CR245","unstructured":"Tammelin O. Solving large imperfect information games using CFR+. 2014. ArXiv:1407.5042"},{"key":"3777_CR246","first-page":"374","volume-title":"Activity Analysis of Production and Allocation","author":"G W Brown","year":"1951","unstructured":"Brown G W. Iterative solution of games by fictitious play. In: Activity Analysis of Production and Allocation. New York: John Wiley & Sons, Inc., 1951. 13: 374\u2013376"},{"key":"3777_CR247","unstructured":"Ganzfried S. Fictitious play outperforms counterfactual regret minimization. 2020. ArXiv:2001.11165"},{"key":"3777_CR248","unstructured":"McMahan H B, Gordon G J, Blum A. Planning in the presence of cost functions controlled by an adversary. In: Proceedings of the International Conference on Machine Learning, Washington, 2003. 536\u2013543"},{"key":"3777_CR249","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/MSP.2020.2973963","volume":"37","author":"X Xu","year":"2020","unstructured":"Xu X, Zhao Q. Distributed no-regret learning in multiagent systems: challenges and recent developments. IEEE Signal Process Mag, 2020, 37: 84\u201391","journal-title":"IEEE Signal Process Mag"},{"key":"3777_CR250","doi-asserted-by":"crossref","unstructured":"Zhang H, Lerer A, Brown N. Equilibrium finding in normal-form games via greedy regret minimization. 2022. ArXiv:2204.04826","DOI":"10.1609\/aaai.v36i9.21181"},{"key":"3777_CR251","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1109\/TAC.2020.3002592","volume":"66","author":"K H Lu","year":"2021","unstructured":"Lu K H, Li G Q, Wang L. Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments. IEEE Trans Automat Contr, 2021, 66: 2289\u20132296","journal-title":"IEEE Trans Automat Contr"},{"key":"3777_CR252","unstructured":"Meng M, Li X X, Hong Y G, et al. Decentralized online learning for noncooperative games in dynamic environments. 2021. ArXiv:2105.06200"},{"key":"3777_CR253","unstructured":"Meng M, Li X X, Jie Chen J. Decentralized Nash equilibria learning for online game with bandit feedback. 2022. ArXiv:2204.09467"},{"key":"3777_CR254","unstructured":"Zhang M X, Zhao P, Luo H P, et al. No-regret learning in time-varying zero-sum games. 2022. ArXiv:2201.12736"},{"key":"3777_CR255","unstructured":"Daskalakis C, Fishelson M, Golowich N. Near-optimal no-regret learning in general games. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34: 1\u201313"},{"key":"3777_CR256","unstructured":"Hsieh Y G, Antonakopoulos K, Mertikopoulos P. Adaptive learning in continuous games: optimal regret bounds and convergence to Nash equilibrium. In: Proceedings of the Annual Conference on Learning Theory, 2021. 2388\u20132422"},{"key":"3777_CR257","unstructured":"Zinkevich M, Johanson M, Bowling M, et al. Regret minimization in games with incomplete information. In: Proceedings of the Advances in Neural Information Processing Systems, 2007. 20: 1\u20138"},{"key":"3777_CR258","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1126\/science.1259433","volume":"347","author":"M Bowling","year":"2015","unstructured":"Bowling M, Burch N, Johanson M, et al. Heads-up limit hold\u2019em poker is solved. Science, 2015, 347: 145\u2013149","journal-title":"Science"},{"key":"3777_CR259","doi-asserted-by":"crossref","unstructured":"Brown N, Sandholm T. Solving imperfect-information games via discounted regret minimization. In: Proceedings of AAAI Conference on Artificial Intelligence, 2019. 33: 1829\u20131836","DOI":"10.1609\/aaai.v33i01.33011829"},{"key":"3777_CR260","unstructured":"Brown N, Lerer A, Gross S, et al. Deep counterfactual regret minimization. In: Proceedings of the International Conference on Machine Learning, 2019. 793\u2013802"},{"key":"3777_CR261","unstructured":"Li H L, Wang X, Qi S H, et al. Solving imperfect-information games via exponential counterfactual regret minimization. 2020. ArXiv:2008.02679v2"},{"key":"3777_CR262","doi-asserted-by":"crossref","unstructured":"Xu H, Li K, Fu H B, et al. AutoCFR: learning to design counterfactual regret minimization algorithms. In: Proceedings of the AAAI Conference on Artificial Intelligence, 2022. 1\u20138","DOI":"10.1609\/aaai.v36i5.20460"},{"key":"3777_CR263","unstructured":"Neller T W, Lanctot M. An introduction to counterfactual regret minimization. In: Proceedings of the Model AI Assignments, the 4th Symposium on Educational Advances in Artificial Intelligence, 2013. 11"},{"key":"3777_CR264","unstructured":"Muller P, Omidshafiei S, Rowland M, et al. A generalized training approach for multiagent learning. In: Proceedings of the International Conference on Learning Representations, 2020. 1\u201313"},{"key":"3777_CR265","unstructured":"Steinberger E. Single deep counterfactual regret minimization. 2019. ArXiv:1901.07621"},{"key":"3777_CR266","doi-asserted-by":"crossref","unstructured":"Mertikopoulos P, Papadimitriou C, Piliouras G. Cycles in adversarial regularized learning. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 2018. 2703\u20132717","DOI":"10.1137\/1.9781611975031.172"},{"key":"3777_CR267","unstructured":"Vlatakis-Gkaragkounis E V, Flokas L, Lianeas T, et al. No-regret learning and mixed Nash equilibria: they do not mix. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 1380\u20131391"},{"key":"3777_CR268","unstructured":"Daskalakis C, Panageas I. Last-iterate convergence: zero-sum games and constrained min-max optimization. 2018. ArXiv:1807.04252"},{"key":"3777_CR269","unstructured":"Abernethy J, Lai K A, Wibisono A. Last-iterate convergence rates for min-max optimization. 2019. ArXiv:1906.02027"},{"key":"3777_CR270","unstructured":"Golowich N, Pattathil S, Daskalakis C, et al. Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems. In: Proceedings of the Annual Conference on Learning Theory, 2020. 1758\u20131784"},{"key":"3777_CR271","doi-asserted-by":"crossref","unstructured":"Conitzer V, Korzhyk D. Commitment to correlated strategies. In: Proceedings of the AAAI Conference on Artificial Intelligence, California, 2011. 632\u2013637","DOI":"10.1609\/aaai.v25i1.7875"},{"key":"3777_CR272","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J F Benders","year":"1962","unstructured":"Benders J F. Partitioning procedures for solving mixed-variables programming problems. Numer Math, 1962, 4: 238\u2013252","journal-title":"Numer Math"},{"key":"3777_CR273","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/crll.1902.124.1","volume":"1902","author":"J Farkas","year":"1902","unstructured":"Farkas J. Theorie der einfachen Ungleichungen. J f\u00fcr die reine und angewandte Mathematik, 1902, 1902: 1\u201327","journal-title":"J f\u00fcr die reine und angewandte Mathematik"},{"key":"3777_CR274","unstructured":"Fischetti M, Salvagnin D, Zanette A. Minimal infeasible subsystems and benders cuts. https:\/\/www.dei.unipd.it\/fisch\/papers\/Benders_mis_extended_draft.pdf"},{"key":"3777_CR275","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R E Gomory","year":"1958","unstructured":"Gomory R E. Outline of an algorithm for integer solutions to linear programs. Bull Amer Math Soc, 1958, 64: 275\u2013278","journal-title":"Bull Amer Math Soc"},{"key":"3777_CR276","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A H Land","year":"1960","unstructured":"Land A H, Doig A G. An automatic method of solving discrete programming problems. Econometrica, 1960, 28: 497\u2013520","journal-title":"Econometrica"},{"key":"3777_CR277","unstructured":"Ruder S. An overview of gradient descent optimization algorithms. 2016. ArXiv:1609.04747"},{"key":"3777_CR278","doi-asserted-by":"crossref","unstructured":"Gottipati S, Paruchuri P. A genetic algorithm approach to compute mixed strategy solutions for general Stackelberg games. In: Proceedings of the IEEE Congress on Evolutionary Computation, Krakow, 2021. 1648\u20131655","DOI":"10.1109\/CEC45853.2021.9505000"},{"key":"3777_CR279","unstructured":"de Nittis G, Trovo F. Machine learning techniques for Stackelberg security games: a survey. 2016. ArXiv:1609.09341"},{"key":"3777_CR280","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/213","volume-title":"Hamilton-Jacobi Equations: Theory and Applications. Volume 213","author":"H V Tran","year":"2021","unstructured":"Tran H V. Hamilton-Jacobi Equations: Theory and Applications. Volume 213. Washington: American Mathematical Society, 2021"},{"key":"3777_CR281","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1109\/TNNLS.2020.3042331","volume":"33","author":"M Li","year":"2022","unstructured":"Li M, Qin J H, Freris N M, et al. Multiplayer Stackelberg-Nash game for nonlinear system via value iteration-based integral reinforcement learning. IEEE Trans Neural Netw Learn Syst, 2022, 33: 1429\u20131440","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3777_CR282","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/TCIAIG.2013.2286295","volume":"5","author":"S Ontan\u00f3n","year":"2013","unstructured":"Ontan\u00f3n S, Synnaeve G, Uriarte A, et al. A survey of real-time strategy game AI research and competition in starCraft. IEEE Trans Comput Intell AI Games, 2013, 5: 293\u2013311","journal-title":"IEEE Trans Comput Intell AI Games"},{"key":"3777_CR283","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1126\/sciadv.aay3761","volume":"5","author":"S Davidai","year":"2019","unstructured":"Davidai S, Ongis M. The politics of zero-sum thinking: the relationship between political ideology and the belief that life is a zero-sum game. Sci Adv, 2019, 5: 12","journal-title":"Sci Adv"},{"key":"3777_CR284","first-page":"407","volume":"17","author":"A von Moll","year":"2020","unstructured":"von Moll A, Garcia E, Casbeer D, et al. Multiple-pursuer, single-evader border defense differential game. J Aerospace Inf Syst, 2020, 17: 407\u2013416","journal-title":"J Aerospace Inf Syst"},{"key":"3777_CR285","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/JAS.2019.1911318","volume":"6","author":"X B Gao","year":"2019","unstructured":"Gao X B, Akyol E, Basar T. Communication scheduling and remote estimation with adversarial intervention. IEEE CAA J Autom Sin, 2019, 6: 32\u201344","journal-title":"IEEE CAA J Autom Sin"},{"key":"3777_CR286","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/JAS.2020.1003480","volume":"8","author":"X X Na","year":"2021","unstructured":"Na X X, Cole D. Theoretical and experimental investigation of driver noncooperative-game steering control behavior. IEEE CAA J Autom Sin, 2021, 8: 189\u2013205","journal-title":"IEEE CAA J Autom Sin"},{"key":"3777_CR287","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/24725854.2022.2045392","volume":"55","author":"L A Albert","year":"2023","unstructured":"Albert L A, Nikolaev A, Jacobson S H. Homeland security research opportunities. IISE Trans, 2023, 55: 22\u201331","journal-title":"IISE Trans"},{"key":"3777_CR288","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/TSP.2011.2169251","volume":"60","author":"X F Song","year":"2012","unstructured":"Song X F, Willett P, Zhou S L, et al. The MIMO radar and jammer games. IEEE Trans Signal Process, 2012, 60: 687\u2013699","journal-title":"IEEE Trans Signal Process"},{"key":"3777_CR289","doi-asserted-by":"crossref","unstructured":"Li H Y, Han Z W, Pu W Q, et al. Counterfactual regret minimization for anti-jamming game of frequency agile radar. 2022. ArXiv:2202.10049","DOI":"10.1109\/SAM53842.2022.9827883"},{"key":"3777_CR290","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TAES.2011.5751244","volume":"47","author":"D J Bachmann","year":"2011","unstructured":"Bachmann D J, Evans R J, Moran B. Game theoretic analysis of adaptive radar jamming. IEEE Trans Aerosp Electron Syst, 2011, 47: 1081\u20131100","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"3777_CR291","unstructured":"Paruchuri P, Pearce J P, Marecki J, et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, 2008. 895\u2013902"},{"key":"3777_CR292","doi-asserted-by":"crossref","unstructured":"Garcia E, Von Moll A, Casbeer D W, et al. Strategies for defending a coastline against multiple attackers. In: Proceedings of the IEEE Conference on Decision and Control (CDC), Nice, 2019. 7319\u20137324","DOI":"10.1109\/CDC40024.2019.9029340"},{"key":"3777_CR293","unstructured":"Goodfellow I, Pouget-Abadie J, Mirza M, et al. Generative adversarial nets. In: Proceedings of the Advances in Neural Information Processing Systems, 2014. 2672\u20132680"},{"key":"3777_CR294","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/MSP.2017.2765202","volume":"35","author":"A Creswell","year":"2018","unstructured":"Creswell A, White T, Dumoulin V, et al. Generative adversarial networks: an overview. IEEE Signal Process Mag, 2018, 35: 53\u201365","journal-title":"IEEE Signal Process Mag"},{"key":"3777_CR295","doi-asserted-by":"crossref","unstructured":"Lelis L H S. Planning algorithms for zero-sum games with exponential action spaces: a unifying perspective. In: Proceedings of the International Conference on International Joint Conferences on Artificial Intelligence, 2021. 4892\u20134898","DOI":"10.24963\/ijcai.2020\/681"},{"key":"3777_CR296","unstructured":"Liu Q H, Wang Y H, Jin C. Learning Markov games with adversarial opponents: efficient algorithms and fundamental limits. 2022. ArXiv:2203.06803"},{"key":"3777_CR297","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TRO.2021.3123896","volume":"38","author":"S Banik","year":"2022","unstructured":"Banik S, Bopardikar S D. Attack-resilient path planning using dynamic games with stopping states. IEEE Trans Robot, 2022, 38: 25\u201341","journal-title":"IEEE Trans Robot"},{"key":"3777_CR298","first-page":"43","volume":"6","author":"H Henderson","year":"2021","unstructured":"Henderson H. Cybered competition, cooperation, and conflict in a game of imperfect information. The Cyber Defense Rev, 2021, 6: 43\u201360","journal-title":"The Cyber Defense Rev"},{"key":"3777_CR299","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1109\/JAS.2017.7510583","volume":"4","author":"K F Wang","year":"2017","unstructured":"Wang K F, Gou C, Duan Y J, et al. Generative adversarial networks: introduction and outlook. IEEE CAA J Autom Sin, 2017, 4: 588\u2013598","journal-title":"IEEE CAA J Autom Sin"},{"key":"3777_CR300","unstructured":"Lee C W, Kroer C, Luo H P. Last-iterate convergence in extensive-form games. In: Proceedings of the Advances in Neural Information Processing Systems, 2021. 34: 1\u201313"},{"key":"3777_CR301","unstructured":"Perolat J, Munos R, Lespiau J B, et al. From Poincar\u00e9 recurrence to convergence in imperfect information games: finding equilibrium via regularization. In: Proceedings of the International Conference on Machine Learning, 2021. 8525\u20138535"},{"key":"3777_CR302","volume-title":"Uncertainty in Games","author":"G Costikyan","year":"2013","unstructured":"Costikyan G. Uncertainty in Games. Cambridge: MIT Press, 2013"},{"key":"3777_CR303","doi-asserted-by":"crossref","unstructured":"Xu L. Learning and planning under uncertainty for green security. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2021. 1\u20133","DOI":"10.24963\/ijcai.2021\/695"},{"key":"3777_CR304","unstructured":"Kar D, Fang F, Fave F D, et al. A game of thrones: when human behavior models compete in repeated Stackelberg security games. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2015. 1381\u20131390"},{"key":"3777_CR305","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.ejor.2020.06.022","volume":"288","author":"W N Caballero","year":"2021","unstructured":"Caballero W N, Lunday B J, Uber R P. Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty. Eur J Operational Res, 2021, 288: 971\u2013982","journal-title":"Eur J Operational Res"},{"key":"3777_CR306","doi-asserted-by":"crossref","unstructured":"Tsiotras P. Bounded rationality in learning, perception, decision-making, and stochastic games. In: Proceedings of the Handbook of Reinforcement Learning and Control, 2021. 491\u2013523","DOI":"10.1007\/978-3-030-60990-0_17"},{"key":"3777_CR307","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2817824","volume":"17","author":"A Platzer","year":"2015","unstructured":"Platzer A. Differential game logic. ACM Trans Comput Logic, 2015, 17: 1\u201351","journal-title":"ACM Trans Comput Logic"},{"key":"3777_CR308","unstructured":"Iyer M, Gilby B. Modeling an adversarial poacher-ranger hybrid game, https:\/\/lfcps.org\/course\/lfcps21\/projects\/bgilby_maiai.pdf"},{"key":"3777_CR309","unstructured":"Brown N, Bakhtin A, Lerer A, et al. Combining deep reinforcement learning and search for imperfect-information games. In: Proceedings of the Advances in Neural Information Processing Systems, 2020. 33: 17057\u201317069"},{"key":"3777_CR310","unstructured":"Li K, Xu H, Zhang M, et al. OpenHoldem: an open toolkit for large-scale imperfect-information game research. 2020. ArXiv:2012.06168"},{"key":"3777_CR311","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TG.2021.3049539","volume":"14","author":"I Oh","year":"2022","unstructured":"Oh I, Rho S, Moon S, et al. Creating pro-level AI for a real-time fighting game using deep reinforcement learning. IEEE Trans Games, 2022, 14: 212\u2013220","journal-title":"IEEE Trans Games"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-022-3777-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-022-3777-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-022-3777-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T21:03:50Z","timestamp":1747775030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-022-3777-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,4]]},"references-count":311,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["3777"],"URL":"https:\/\/doi.org\/10.1007\/s11432-022-3777-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,4]]},"assertion":[{"value":"28 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"141201"}}