Distributed Nash equilibrium seeking: A gossip-based algorithm

This paper presents an asynchronous gossip-based algorithm for finding a Nash equilibrium (NE) of a game in a distributed multi-player network. The algorithm is designed in such a way that players make decisions based on estimates of the other players’ actions obtained from local neighbors. Using a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Automatica (Oxford) Jg. 72; S. 209 - 216
Hauptverfasser:	Salehisadaghiani, Farzad, Pavel, Lacra
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.10.2016
Schlagworte:	Communication graph Distributed algorithms Noncooperative games Communication graph Distributed algorithms Noncooperative games
ISSN:	0005-1098, 1873-2836
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!