Abstract
We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized aggregative equilibria of the game as the zeros of a monotone set-valued operator. Then, we massage the Douglas-Rachford splitting to solve the monotone inclusion problem and derive a single layer, semi-decentralized algorithm whose global convergence is guaranteed under mild assumptions. The potential of the proposed Douglas-Rachford algorithm is shown on a simplified resource allocation game, where we observe faster convergence with respect to forward-backward algorithms.
Original language | English |
---|---|
Title of host publication | Proceedings of the 57th IEEE Conference on Decision and Control (CDC 2018) |
Editors | Andrew R. Teel, Magnus Egerstedt |
Place of Publication | Piscataway, NJ, USA |
Publisher | IEEE |
Pages | 3541-3546 |
ISBN (Electronic) | 978-1538-1395-5 |
DOIs | |
Publication status | Published - 2018 |
Event | CDC 2018: 57th IEEE Conference on Decision and Control - Miami, United States Duration: 17 Dec 2018 → 19 Dec 2018 |
Conference
Conference | CDC 2018: 57th IEEE Conference on Decision and Control |
---|---|
Country/Territory | United States |
City | Miami |
Period | 17/12/18 → 19/12/18 |