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...

Full description

Bibliographic Details

Published in:	Automatica (Oxford) Vol. 72; pp. 209 - 216
Main Authors:	Salehisadaghiani, Farzad, Pavel, Lacra
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.10.2016
Subjects:	Communication graph Distributed algorithms Noncooperative games Communication graph Distributed algorithms Noncooperative games
ISSN:	0005-1098, 1873-2836
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!