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

DOI10.1109/TCNS.2019.2944300OpenAlexW2975476315MaRDI QIDQ4969428FDOQ4969428

Authors: Francesca Parise, Basilio Gentile, 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)

Cited In (10)

• Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
• Distributed adaptive generalized Nash equilibrium seeking algorithm with event-triggered communication
• Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
• On a differential generalized Nash equilibrium problem with mean field interaction
• Distributed dynamics for aggregative games: Robustness and privacy guarantees
• A distributed algorithm to obtain repeated games equilibria with discounting
• Distributed Nash equilibrium seeking for aggregative games with coupled constraints
• Distributed Nash equilibrium learning: A second‐order proximal algorithm
• Fast generalized Nash equilibrium seeking under partial-decision information
• Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents

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

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