Distributed averaging integral Nash equilibrium seeking on networks

From MaRDI portal
Publication:2280964

DOI10.1016/J.AUTOMATICA.2019.108548zbMATH Open1429.93133arXiv1812.00445OpenAlexW2971931235WikidataQ127285732 ScholiaQ127285732MaRDI QIDQ2280964FDOQ2280964


Authors: C. De Persis, Sergio Grammatico Edit this on Wikidata


Publication date: 19 December 2019

Published in: Automatica (Search for Journal in Brave)

Abstract: Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity property under a suitable monotonicity assumption. This feature has been exploited to design distributed algorithms that converge to Nash equilibria and use local information only. We further exploit the passivity property to interconnect the algorithms with distributed 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 high-gain.


Full work available at URL: https://arxiv.org/abs/1812.00445




Recommendations




Cites Work


Cited In (25)





This page was built for publication: Distributed averaging integral Nash equilibrium seeking on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280964)