Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
From MaRDI portal
Publication:2107641
DOI10.1016/J.SYSCONLE.2022.105401zbMATH Open1505.91015arXiv2106.10697OpenAlexW4309198770MaRDI QIDQ2107641FDOQ2107641
Authors: Xin Cai, Feng Xiao, Bo Wei 
Publication date: 2 December 2022
Published in: Systems \& Control Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2106.10697
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
Noncooperative games (91A10) Time-scale analysis and singular perturbations in control/observation systems (93C70) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Multi-agent systems (93A16)
Cites Work
- Title not available (Why is that?)
- Nonlinear systems.
- Title not available (Why is that?)
- Higher order game dynamics
- On generalized Nash games and variational inequalities
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed algorithms for aggregative games on graphs
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints
- Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- Distributed algorithm design for aggregative games of disturbed multiagent systems over weight‐balanced digraphs
- Dynamic NE Seeking for Multi-Integrator Networked Agents With Disturbance Rejection
- A Feedback Control Algorithm to Steer Networks to a Cournot–Nash Equilibrium
- Distributed averaging integral Nash equilibrium seeking on networks
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Continuous-Time Integral Dynamics for a Class of Aggregative Games With Coupling Constraints
- Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
- Distributed convergence to Nash equilibria in network and average aggregative games
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- Leader–Follower Network Aggregative Game With Stochastic Agents’ Communication and Activeness
Cited In (2)
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)
