{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:07:48Z","timestamp":1777572468837,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61903027"],"award-info":[{"award-number":["61903027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62003239"],"award-info":[{"award-number":["62003239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72171171"],"award-info":[{"award-number":["72171171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton. Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. The key feature of our method is that the proposed projected dynamics achieves exponential convergence, whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium seeking. Numerical examples illustrate the effectiveness of our methods.<\/jats:p>","DOI":"10.1007\/s43684-022-00024-4","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T10:02:47Z","timestamp":1649757767000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games"],"prefix":"10.1007","volume":"2","author":[{"given":"Shu","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2494-1505","authenticated-orcid":false,"given":"Peng","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiguang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaixiang","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/MSP.2012.2186410","volume":"29","author":"W. Saad","year":"2012","unstructured":"W. Saad, Z. Han, H.V. Poor, T. Basar, Game-theoretic methods for the smart grid: an overview of microgrid systems, demand-side management, and smart grid communications. IEEE Signal Process. Mag. 29(5), 86\u2013105 (2012)","journal-title":"IEEE Signal Process. Mag."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1038\/s41586-021-04357-7","volume":"602","author":"P.R. Wurman","year":"2022","unstructured":"P.R. Wurman, S. Barrett, K. Kawamoto et al., Outracing champion Gran Turismo drivers with deep reinforcement learning. Nature 602, 223\u2013228 (2022)","journal-title":"Nature"},{"issue":"5","key":"24_CR3","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TAC.1979.1102161","volume":"24","author":"H.K. Khalil","year":"1979","unstructured":"H.K. Khalil, P.V. Kokotovic, Feedback and well-posedness of singularly perturbed Nash games. IEEE Trans. Autom. Control 24(5), 699\u2013708 (1979)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1109\/TAC.2005.843878","volume":"50","author":"J.S. Shamma","year":"2005","unstructured":"J.S. Shamma, G. Arslan, Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria. IEEE Trans. Autom. Control 50(3), 312\u2013327 (2005)","journal-title":"IEEE Trans. Autom. Control"},{"key":"24_CR5","first-page":"1729","volume-title":"Advances in Neural Information Processing Systems","author":"M. Zinkevich","year":"2007","unstructured":"M. Zinkevich, M. Johanson, M. Bowling, C. Piccione, Regret minimization in games with incomplete information, in Advances in Neural Information Processing Systems, vol.\u00a020 (Curran Associates, Vancouver, 2007), pp. 1729\u20131736"},{"issue":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/TAC.2011.2173412","volume":"57","author":"P. Frihauf","year":"2012","unstructured":"P. Frihauf, M. Krstic, T. Basar, Nash equilibrium seeking in noncooperative games. IEEE Trans. Autom. Control 57(5), 1192\u20131207 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TAC.2014.2348197","volume":"60","author":"J. Barrera","year":"2015","unstructured":"J. Barrera, A. Garcia, Dynamic incentives for congestion control. IEEE Trans. Autom. Control 60(2), 299\u2013310 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10640-015-9900-6","volume":"63","author":"R. Cornes","year":"2016","unstructured":"R. Cornes, Aggregative environmental games. Environ. Resour. Econ. 63(2), 339\u2013365 (2016)","journal-title":"Environ. Resour. Econ."},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.3982\/ECTA14720","volume":"86","author":"V. Nocke","year":"2018","unstructured":"V. Nocke, N. Schutz, Multiproduct-firm oligopoly: an aggregative games approach. Econometrica 86(2), 523\u2013557 (2018)","journal-title":"Econometrica"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.2016.1501","volume":"63","author":"J. Koshal","year":"2016","unstructured":"J. Koshal, A. Nedi\u0107, U.V. Shanbhag, Distributed algorithms for aggregative games on graphs. Oper. Res. 63(3), 680\u2013704 (2016)","journal-title":"Oper. Res."},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TCYB.2016.2524452","volume":"47","author":"M. Ye","year":"2017","unstructured":"M. Ye, G. Hu, Game design and analysis for price-based demand response: an aggregate game approach. IEEE Trans. Cybern. 47(3), 720\u2013730 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"11","key":"24_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.automatica.2017.07.064","volume":"85","author":"S. Liang","year":"2017","unstructured":"S. Liang, P. Yi, Y. Hong, Distributed Nash equilibrium seeking for aggregative games with coupled constraints. Automatica 85(11), 179\u2013185 (2017)","journal-title":"Automatica"},{"key":"24_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109794","volume":"132","author":"Z. Deng","year":"2021","unstructured":"Z. Deng, Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games. Automatica 132, 109794 (2021)","journal-title":"Automatica"},{"issue":"7","key":"24_CR14","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1109\/TAC.2020.3015354","volume":"66","author":"D. Gadjov","year":"2021","unstructured":"D. Gadjov, L. Pavel, Single-timescale distributed GNE seeking for aggregative games over networks via forward\u2013backward operator splitting. IEEE Trans. Autom. Control 66(7), 3259\u20133266 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"24_CR15","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1109\/TAC.2020.3008113","volume":"66","author":"Y. Zhu","year":"2021","unstructured":"Y. Zhu, W. Yu, G. Wen, G. Chen, Distributed Nash equilibrium seeking in an aggregative game on a directed graph. IEEE Trans. Autom. Control 66(6), 2746\u20132753 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"24_CR16","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1109\/TAC.2020.3005922","volume":"66","author":"G. Belgioioso","year":"2021","unstructured":"G. Belgioioso, A. Nedi\u0107, S. Grammatico, Distributed generalized Nash equilibrium seeking in aggregative games on time-varying networks. IEEE Trans. Autom. Control 66(5), 2061\u20132075 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"12","key":"24_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.automatica.2016.08.007","volume":"74","author":"P. Yi","year":"2016","unstructured":"P. Yi, Y. Hong, F. Liu, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and its application to economic dispatch of power systems. Automatica 74(12), 259\u2013269 (2016)","journal-title":"Automatica"},{"issue":"4","key":"24_CR18","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1137\/16M1084316","volume":"27","author":"A. Nedi\u0107","year":"2017","unstructured":"A. Nedi\u0107, A. Olshevsky, W. Shi, Achieving geometric convergence for distributed optimization over time-varying graphs. SIAM J. Optim. 27(4), 2597\u20132633 (2017)","journal-title":"SIAM J. Optim."},{"key":"24_CR19","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems. Operations Research","author":"F. Facchinei","year":"2003","unstructured":"F. Facchinei, J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems. Operations Research (Springer, New York, 2003)"},{"key":"24_CR20","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"C. Godsil, G.F. Royle, Algebraic Graph Theory. Graduate Texts in Mathematics, vol.\u00a0207 (Springer, New York, 2001)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.automatica.2019.01.008","volume":"102","author":"P. Yi","year":"2019","unstructured":"P. Yi, L. Pavel, An operator splitting approach for distributed generalized Nash equilibria computation. Automatica 102, 111\u2013121 (2019)","journal-title":"Automatica"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/TNNLS.2018.2850763","volume":"30","author":"Z. Deng","year":"2019","unstructured":"Z. Deng, X. Nian, Distributed generalized Nash equilibrium seeking algorithm design for aggregative games over weight-balanced digraphs. IEEE Trans. Neural Netw. Learn. Syst. 30(3), 695\u2013706 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"24_CR23","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TCNS.2019.2944300","volume":"7","author":"F. Parise","year":"2020","unstructured":"F. Parise, B. Gentile, J. Lygeros, A distributed algorithm for almost-Nash equilibria of average aggregative games with coupling constraints. IEEE Trans. Control Netw. Syst. 7(2), 770\u2013782 (2020)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.automatica.2018.09.004","volume":"98","author":"H. Zhang","year":"2018","unstructured":"H. Zhang, J. Wei, P. Yi, X. Hu, Projected primal\u2013dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network. Automatica 98, 34\u201341 (2018)","journal-title":"Automatica"},{"key":"24_CR25","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"2013","unstructured":"R.A. Horn, C.R. Johnson, Matrix Analysis, 2nd ed. (Cambridge University Press, Cambridge, 2013)","edition":"2"},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.automatica.2019.04.004","volume":"105","author":"S. Liang","year":"2019","unstructured":"S. Liang, L. Wang, G. Yin, Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity. Automatica 105, 298\u2013306 (2019)","journal-title":"Automatica"}],"container-title":["Autonomous Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43684-022-00024-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43684-022-00024-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43684-022-00024-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T10:07:48Z","timestamp":1649758068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43684-022-00024-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s43684-022-00024-4","relation":{},"ISSN":["2730-616X"],"issn-type":[{"value":"2730-616X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]},"assertion":[{"value":"8 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6"}}