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

by   Carlo Cenedese, et al.

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 converge to a variational GNE 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 the only other in the literature (ADAGNES), and observe that AD-GENO outperforms the alternative.


page 1

page 2

page 3

page 4


Stochastic generalized Nash equilibrium seeking in merely monotone games

We solve the stochastic generalized Nash equilibrium (SGNE) problem in m...

An asynchronous, forward-backward, distributed generalized Nash equilibrium seeking algorithm

In this paper, we propose an asynchronous distributed algorithm for the ...

A Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games

We address the generalized Nash equilibrium seeking problem for noncoope...

Distributed Forward-Backward algorithms for stochastic generalized Nash equilibrium seeking

We consider the stochastic generalized Nash equilibrium problem (SGNEP) ...

Bregman algorithms for a class of Mixed-Integer Generalized Nash Equilibrium Problems

We consider the problem of computing a mixed-strategy generalized Nash e...

Controlling network coordination games

We study a novel control problem in the context of network coordination ...