{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:30:37Z","timestamp":1771702237682,"version":"3.50.1"},"reference-count":86,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000848","name":"University of Edinburgh","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000848","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ECFI Major Initiatives Fund"},{"name":"Smart Data Foundry"},{"name":"Excellence initiative-research university"},{"name":"AGH University","award":["UMO- 2021\/01\/2\/ST6\/00004"],"award-info":[{"award-number":["UMO- 2021\/01\/2\/ST6\/00004"]}]},{"name":"AGH University","award":["ARTIQ\/0004\/2021"],"award-info":[{"award-number":["ARTIQ\/0004\/2021"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tpami.2024.3445666","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T17:28:45Z","timestamp":1724088525000},"page":"10797-10813","source":"Crossref","is-referenced-by-count":8,"title":["Approaching the Global Nash Equilibrium of Non-Convex Multi-Player Games"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0698-7910","authenticated-orcid":false,"given":"Guanpu","family":"Chen","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4134-8455","authenticated-orcid":false,"given":"Gehui","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Imperial College London, London, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5584-2385","authenticated-orcid":false,"given":"Fengxiang","family":"He","sequence":"additional","affiliation":[{"name":"Artificial Intelligence and its Applications Institute, School of Informatics, University of Edinburgh, Edinburgh, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9505-8739","authenticated-orcid":false,"given":"Yiguang","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, Research Institute for Intelligent Autonomous Systems, Tongji University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6960-9525","authenticated-orcid":false,"given":"Leszek","family":"Rutkowski","sequence":"additional","affiliation":[{"name":"AGH University, Kraków, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"College of Computing & Data Science, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","first-page":"7194","article-title":"Multi-agent adversarial inverse reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793661"},{"key":"ref3","article-title":"Fault-tolerant federated reinforcement learning with theoretical guarantee","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fan"},{"key":"ref4","first-page":"27479","article-title":"Topology-aware generalization of decentralized SGD","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhu"},{"key":"ref5","first-page":"7472","article-title":"Multi-agent generative adversarial imitation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Song"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3127558"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2186410"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.12.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926399"},{"key":"ref10","first-page":"4193","article-title":"A unified game-theoretic approach to multiagent reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lanctot"},{"key":"ref11","first-page":"1125","article-title":"SBEED: Convergent reinforcement learning with nonlinear function approximation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.226"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58017-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765642"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2885052"},{"key":"ref17","article-title":"Solving a class of non-convex min-max games using iterative first order methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nouiehed"},{"key":"ref18","first-page":"1387","article-title":"Local stochastic gradient descent ascent: Convergence analysis and communication efficiency","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Deng"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2019.2911895"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2438832"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2900306"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3071594"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.01.008"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109313"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/090749499"},{"key":"ref26","article-title":"Global convergence to local minmax equilibrium in classes of nonconvex zero-sum games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fiez"},{"key":"ref27","first-page":"6083","article-title":"On gradient descent ascent for nonconvex-concave minimax problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lin"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.1895152"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970524.ch1"},{"key":"ref30","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei","year":"2003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/18M1172314"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1501"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3002592"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3175831"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1946"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2001.980175"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2023.3314576"},{"key":"ref38","first-page":"6629","article-title":"GANs trained by a two time-scale update rule converge to a local Nash equilibrium","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Heusel"},{"key":"ref39","first-page":"9256","article-title":"The limit points of (optimistic) gradient descent in min-max optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Daskalakis"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"ref41","first-page":"1","article-title":"Training GANs with optimism","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Daskalakis"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/100811787"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1344-7"},{"key":"ref44","first-page":"5291","article-title":"Game theoretic optimization via gradient-based Nikaido-Isoda function","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Raghunathan"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1321"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2228038"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0860-0"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3115430"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2018.10.050"},{"key":"ref50","first-page":"1","article-title":"A variational inequality perspective on generative adversarial networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Gidel"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/640391"},{"key":"ref52","first-page":"2958","article-title":"Adversarial weight perturbation helps robust generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref53","article-title":"Sharpness-aware minimization for efficiently improving generalization","author":"Foret","year":"2020"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.05960"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2646346"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2930051"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-011-9660-y"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582255"},{"key":"ref59","volume-title":"Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models","volume":"58","author":"Giannessi","year":"2006"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4754(84)90101-0"},{"key":"ref61","first-page":"2845","article-title":"Accelerated mirror descent in continuous and discrete time","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Krichene"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3244995"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01681-8"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-62-02933-2"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206773"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2478124"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2922953"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1254-8"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0738"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1992.227087"},{"key":"ref71","article-title":"MNIST handwritten digit database","author":"LeCun","year":"2010"},{"key":"ref73","first-page":"747","article-title":"The extragradient method for finding saddle points and other problems","volume":"12","author":"Korpelevich","year":"1976","journal-title":"Matecon"},{"key":"ref74","article-title":"Explaining and harnessing adversarial examples","author":"Goodfellow","year":"2014"},{"key":"ref75","article-title":"Towards deep learning models resistant to adversarial attacks","author":"Madry","year":"2017"},{"key":"ref76","article-title":"Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation","author":"Xu","year":"2024"},{"key":"ref78","article-title":"Benefits of permutation-equivariance in auction mechanisms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Qin"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3284822"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3049463"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3091182"},{"issue":"1","key":"ref82","first-page":"127","article-title":"Canonical dual transformation method and generalized triality theory in nonsmooth global optimization","volume":"17","author":"Yang Gao","year":"2000","journal-title":"J. Glob. Optim."},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4hws"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499354564"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1137\/120894464"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3139266"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2014.2311122"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10746266\/10638825.pdf?arnumber=10638825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T14:48:01Z","timestamp":1732718881000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10638825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":86,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3445666","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}