A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
From MaRDI portal
Publication:5211223
DOI10.1109/TAC.2019.2901820zbMath1482.91008arXiv1708.02394MaRDI QIDQ5211223
Maojiao Ye, Guoqiang Hu, Frank L. Lewis, Xie, Lihua
Publication date: 28 January 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02394
Related Items (12)
Suboptimal output consensus of a group of discrete-time heterogeneous linear non-minimum phase systems ⋮ Games on signed graphs ⋮ An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games ⋮ Adaptive approaches for fully distributed Nash equilibrium seeking in networked games ⋮ Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network ⋮ On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information ⋮ Prescribed-time distributed Nash equilibrium seeking for noncooperation games ⋮ Nonlinear placement for networked Euler‐Lagrange systems: A finite‐time hierarchical approach ⋮ Generalized multi-cluster game under partial-decision information with applications to management of energy Internet ⋮ Distributed robust Nash equilibrium seeking for aggregative games under persistent attacks: a hybrid systems approach ⋮ Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method ⋮ Solving leaderless multi-cluster games over directed graphs
This page was built for publication: A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games