EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Distributed Nash Equilibrium Seeking in Aggregative Games Over Jointly Connected and Weight-Balanced Networks

Zhaocong Liu, Jie Huang

IEEE Transactions on Automatic Control · 2025-05 · 70 (5) · 3486-3493

DOI: 10.1109/tac.2024.3520809 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Automatic Control, 2025-05. Verfasst von Zhaocong Liu und 1 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Research Grants Council of the Hong Kong Special Administration Region.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The problem of the distributed Nash equilibrium (NE) seeking for aggregative games has been studied over strongly connected and weight-balanced static networks and every time strongly connected and weight-balanced switching networks. In this article, we further study the same problem over jointly connected and weight-balanced networks. The existing approaches critically rely on the connectedness of the network and these approaches fail if the network is not connected. To overcome this difficulty, we propose a novel approach to showing the exponential convergence of the output of the closed-loop system to the unknown NE point under a set of mild conditions. For this purpose, we need to establish the exponential stability for a time-varying ancillary system. By the converse Lyapunov theorem, this result guarantees the existence of a time-varying quadratic Lyapunov function for the ancillary system, which in turn leads to the construction of a suitable Lyapunov function for the closed-loop system, thus leading to the solution of the problem. A numerical example is presented to validate the effectiveness of our distributed algorithm.

Förderung

  • Research Grants Council of the Hong Kong Special Administration Region

Zitieren

APA

Liu, Z., & Huang, J. (2025). Distributed Nash Equilibrium Seeking in Aggregative Games Over Jointly Connected and Weight-Balanced Networks. IEEE Transactions on Automatic Control, 70(5), 3486-3493. https://doi.org/10.1109/tac.2024.3520809

Vancouver

Liu Z, Huang J. Distributed Nash Equilibrium Seeking in Aggregative Games Over Jointly Connected and Weight-Balanced Networks. IEEE Transactions on Automatic Control. 2025;70(5):3486-3493. doi:10.1109/tac.2024.3520809

BibTeX
@article{Liu2025,
  author = {Liu, Zhaocong and Huang, Jie},
  title = {Distributed Nash Equilibrium Seeking in Aggregative Games Over Jointly Connected and Weight-Balanced Networks},
  journal = {IEEE Transactions on Automatic Control},
  year = {2025},
  volume = {70},
  number = {5},
  pages = {3486--3493},
  doi = {10.1109/tac.2024.3520809}
}
Kostenlos starten →