Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
arXiv:1911.12266 · doi:10.1016/j.automatica.2021.109660
Abstract
We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on consensus and primal-dual gradient dynamics, to seek a generalized Nash equilibrium in networks of single-integrator agents. Our first solution adopts a fixed gain, whose choice requires the knowledge of some global parameters of the game. To relax this requirement, we conceive a controller that can be tuned in a completely decentralized fashion, thanks to the use of uncoordinated integral adaptive weights. We further introduce algorithms specifically devised for generalized aggregative games. Finally, we adapt all our control schemes to deal with heterogeneous multi-integrator agents and, in turn, with nonlinear feedback-linearizable dynamical systems. For all the proposed dynamics, we show convergence to a variational equilibrium, by leveraging monotonicity properties and stability theory for projected dynamical systems.
Accepted in Automatica
References in corpus (1)
Cited by in corpus (7)
- Nash Equilibrium Seeking for General Linear Systems with Disturbance Rejection
- Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
- Distributed Nash Equilibrium Seeking Algorithm Design for Multi-Cluster Games with High-Order Players
- Fully Distributed Nash Equilibrium Seeking for High-order Players with Bounded Controls and Directed Graphs
- Nash Equilibrium Seeking for High-order Multi-agent Systems with Unknown Dynamics
- Nash Equilibrium Seeking for Games in Second-order Systems without Velocity Measurement
- Distributed continuous-time strategy-updating rules for noncooperative games with discrete-time communication