A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints

DOI10.1109/TCNS.2019.2944300OpenAlexW2975476315MaRDI QIDQ4969428

Basilio Gentile, Francesca Parise, John Lygeros

Publication date: 5 October 2020

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcns.2019.2944300

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Related Items (6)

Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents ⋮ Distributed dynamics for aggregative games: Robustness and privacy guarantees ⋮ Distributed Nash equilibrium learning: A second‐order proximal algorithm ⋮ Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach ⋮ Fast generalized Nash equilibrium seeking under partial-decision information ⋮ Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints

This page was built for publication: A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints