Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - Automatica, 2019 - Elsevier
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - arXiv preprint arXiv:1812.00445, 2018 - arxiv.org
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption. This feature has been exploited to …

Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - Automatica, 2019 - research.rug.nl
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

Distributed averaging integral Nash equilibrium seeking on networks

C de Persis, S Grammatico - Automatica: A journal of IFAC the …, 2019 - dialnet.unirioja.es
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - Automatica, 2019 - research.tudelft.nl
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - arXiv e-prints, 2018 - ui.adsabs.harvard.edu
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption. This feature has been exploited to …

Distributed averaging integral Nash equilibrium seeking on networks

C De Persis, S Grammatico - 2019 - dl.acm.org
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …