Publication

Distributed averaging integral Nash equilibrium seeking on networks

De Persis, C. & Grammatico, S., Dec-2019, In : Automatica. 110, 7 p., 108548.

Research output: Contribution to journalArticleAcademicpeer-review

Copy link to clipboard

Documents

  • Distributed averaging integral Nash equilibrium seeking on networks

    Final publisher's version, 540 KB, PDF document

    Request copy

DOI

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. (C) 2019 Elsevier Ltd. All rights reserved.

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

    Keywords

  • GAMES, CONVERGENCE, ALGORITHMS, DYNAMICS

ID: 109027991