Distributed averaging integral Nash equilibrium seeking on networks

Claudio De Persis, Sergio Grammatico

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity property under a suitable monotonicity assumption, which has been exploited to design distributed Nash equilibrium seeking algorithms. We further exploit the passivity property to interconnect the algorithms with distributed nonlinear averaging integral controllers that tune on-line the weights of the communication graph. The main advantage is to guarantee convergence to a Nash equilibrium without requiring a strong coupling condition on the algebraic connectivity of the communication graph over which the players exchange information, nor a global fixed high-gain.

Original languageEnglish
Article number108548
Number of pages7
JournalAutomatica
Volume110
DOIs
Publication statusPublished - 2019

Fingerprint Dive into the research topics of 'Distributed averaging integral Nash equilibrium seeking on networks'. Together they form a unique fingerprint.

  • Cite this