Semi-Decentralized Generalized Nash Equilibrium Seeking in Monotone Aggregative Games
METADATA ONLY
Loading...
Author / Producer
Date
2023-01
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
We address the generalized Nash equilibrium seeking problem for a population of agents playing aggregative games with affine coupling constraints. We focus on semi-decentralized communication architectures, where there is a central coordinator able to gather and broadcast signals of aggregative nature to the agents. By exploiting the framework of monotone operator theory and operator splitting, we first critically review the most relevant available algorithms and then design two novel schemes: 1) a single-layer, fixed-step algorithm with convergence guarantee for general (noncocoercive, nonstrictly) monotone aggregative games and 2) a single-layer proximal-type algorithm for a class of monotone aggregative games with linearly coupled cost functions. We also design novel accelerated variants of the algorithms via (alternating) inertial and over-relaxation steps. Finally, we show via numerical simulations that the proposed algorithms outperform those in the literature in terms of convergence speed.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
68 (1)
Pages / Article No.
140 - 155
Publisher
IEEE
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Distributed algorithms; Multi-agent systems; Optimization methods; Scalability
Organisational unit
09478 - Dörfler, Florian / Dörfler, Florian