An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games

Journal article (2021)

Authors

Carlo Cenedese Rijksuniversiteit Groningen
Giuseppe Belgioioso Eindhoven University of Technology
S. Grammatico Team Bart De Schutter - Mechanical, Maritime and Materials Engineering
Ming Cao Rijksuniversiteit Groningen
Research Group
Team Bart De Schutter (Mechanical, Maritime and Materials Engineering) (TU Delft)
Copyright: © 2021 Carlo Cenedese, Giuseppe Belgioioso, S. Grammatico, Ming Cao
DOI
help_outline
https://doi.org/10.1016/j.ejcon.2020.08.006
Game theory Asynchronous update Delayed communication Monotone games Operator theory Variational GNE
More Info
expand_more

Published Date

2021

Language

English

Faculty

Mechanical, Maritime and Materials Engineering

Department

Delft Center for Systems and Control

Research Group

Team Bart De Schutter

Abstract

In this paper, we present three distributed algorithms to solve a class of Generalized Nash Equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates of the agents, while the second and the third (AD-GEED and AD-GENO) represent asynchronous solutions that are robust to communication delays. AD-GENO can be seen as a refinement of AD-GEED, since it only requires node auxiliary variables, enhancing the scalability of the algorithm. Our main contribution is to prove convergence to a v-GNE variational-GNE (vGNE) of the game via an operator-theoretic approach. Finally, we apply the algorithms to network Cournot games and show how different activation sequences and delays affect convergence. We also compare the proposed algorithms to a state-of-the-art algorithm solving a similar problem, and observe that AD-GENO outperforms it.