In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undirected communication graph. Specifically, we extend the paper "Asynchronous distributed algorithm for seeking generalized Nash equilibria" by Yi and Pavel: we redesign the asynchronous update rule using auxiliary variables over the nodes rather than over the edges. This key modification renders the algorithm scalable for highly interconnected games. The derived asynchronous algorithm is robust against delays in the communication and it eliminates the idle times between computations, hence modeling a more realistic interaction between players with different update frequencies. We address the problem from an operator-theoretic perspective and design the algorithm via a preconditioned forward-backward splitting. Finally, we numerically simulate the algorithm for the Cournot competition in networked markets.
An Asynchronous, Forward-Backward, Distributed Generalized Nash Equilibrium Seeking Algorithm (I)
2019-01-01
Cenedese , C , Belgioioso , G , Grammatico , S & Cao , M 2019 , An Asynchronous, Forward-Backward, Distributed Generalized Nash Equilibrium Seeking Algorithm (I) . in Proceedings of the European Control Conference 2019 . IEEE , 18th European Control Conference, ECC 2019 , Naples , Italy , 25/06/2019 . https://doi.org/10.23919/ECC.2019.8795952
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Distributed Generalized Nash Equilibrium Seeking for Energy Sharing Games in Prosumers.
BASE | 2021
|Distributed Nash Equilibrium Seeking for Non-Cooperative Games with a Coupled Inequality Constraint
Springer Verlag | 2021
|Method and system for backward seeking vehicle and forward seeking parking space
Europäisches Patentamt | 2015
|Gram-Schmidt Forward-Backward Generalized Sidelobe Canceller
Online Contents | 1994
|