Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
From MaRDI portal
Publication:2107641
Abstract: In this paper, we explore aggregative games over networks of multi-integrator agents with coupled constraints. To reach the general Nash equilibrium of an aggregative game, a distributed strategy-updating rule is proposed by a combination of the coordination of Lagrange multipliers and the estimation of the aggregator. Each player has only access to partial-decision information and communicates with his neighbors in a weight-balanced digraph which characterizes players' preferences as to the values of information received from neighbors. We first consider networks of double-integrator agents and then focus on multi-integrator agents. The effectiveness of the proposed strategy-updating rules is demonstrated by analyzing the convergence of corresponding dynamical systems via the Lyapunov stability theory, singular perturbation theory and passive theory. Numerical examples are given to illustrate our results.
Recommendations
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- Distributed algorithm design for aggregative games of disturbed multiagent systems over weight-balanced digraphs
- Distributed convergence to Nash equilibria in network and average aggregative games
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints
- A Feedback Control Algorithm to Steer Networks to a Cournot–Nash Equilibrium
- Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
- Continuous-Time Integral Dynamics for a Class of Aggregative Games With Coupling Constraints
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed algorithm design for aggregative games of disturbed multiagent systems over weight-balanced digraphs
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- Distributed algorithms for aggregative games on graphs
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed convergence to Nash equilibria in network and average aggregative games
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Dynamic NE Seeking for Multi-Integrator Networked Agents With Disturbance Rejection
- Higher order game dynamics
- Leader–Follower Network Aggregative Game With Stochastic Agents’ Communication and Activeness
- Nash Equilibrium Seeking in Noncooperative Games
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- Nonlinear systems.
- On generalized Nash games and variational inequalities
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
Cited in
(3)
This page was built for publication: Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107641)
