Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
From MaRDI portal
Publication:2665155
Abstract: This paper considers the design of fully distributed Nash equilibrium seeking strategies for multi-agent games. To develop fully distributed seeking strategies, two adaptive control laws, including a node-based control law and an edge-based control law, are proposed. In the node-based adaptive strategy, each player adjusts their own weight on their procurable consensus error dynamically. Moreover, in the edge-based algorithm, the fully distributed strategy is designed by adjusting the weights on the edges of the communication graph adaptively. By utilizing LaSalle's invariance principle, it is shown that the Nash equilibrium is globally asymptotically stable by both strategies given that the players' objective functions are twice-continuously differentiable, the partial derivatives of the players' objective functions with respect to their own actions are globally Lipschitz, the pseudo-gradient vector of the game is strongly monotone and the communication network is undirected and connected. In addition, we further show that the edge-based method can be easily adapted to accommodate time-varying communication conditions, in which the communication network is switching among a set of undirected and connected graphs. In the last, a numerical example is given to illustrate the effectiveness of the proposed methods.
Recommendations
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- Distributed Nash equilibrium seeking in networked graphical games
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- Distributed best response dynamics for Nash equilibrium seeking in potential games
Cites work
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Adaptive nonlinear control without overparametrization
- An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games
- Consensus of Multi-Agent Systems With General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols
- Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
- Distributed algorithms for aggregative games on graphs
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed Consensus of Second-Order Multi-Agent Systems With Heterogeneous Unknown Inertias and Control Gains Under a Directed Graph
- Distributed control gains design for consensus in multi-agent systems with second-order nonlinear dynamics
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Fast convergence to Nash equilibria without steady-state oscillation
- Fully Distributed Consensus Control for Linear Multiagent Systems: A Reduced-Order Adaptive Feedback Approach
- Nash equilibrium seeking for N-coalition noncooperative games
- Nonlinear systems.
Cited in
(26)- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Decentralized inertial best-response with voluntary and limited communication in random communication networks
- Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- Distributed formation control with open-loop Nash strategy
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Nash equilibrium seeking with non-doubly stochastic communication weight matrix
- Distributed generalized Nash equilibrium seeking for noncooperative games with unknown cost functions
- Robust Distributed Nash Equilibrium Seeking for Games Under Attacks and Communication Delays
- Fully distributed attack-resilient Nash equilibrium seeking for networked games subject to DoS attacks
- Distance‐targeted competitive follower‐attraction containment control for multi‐agent systems with weighted directed graphs
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach
- Distributed adaptive generalized Nash equilibrium seeking algorithm with event-triggered communication
- Communication-efficient distributed Nash equilibrium seeking under switching topologies: a decentralized gradient-based event-triggered scheme
- Prescribed-time fully distributed Nash equilibrium seeking of nonlinear multi-agent systems over unbalanced digraphs
- Distributed Nash equilibrium seeking in networked graphical games
- Distributed adaptive Nash equilibrium seeking for networked systems with unknown disturbance and actuator saturation
- A distributed observer design for linear system synchronization over corrupted graph communication
- Distributed generalized Nash equilibrium seeking approach via surrogate functions for noncooperative nonconvex games
- Designing edge-based and node-based fully distributed algorithms for aggregative games with the adaptive technique
- A double-layer adaptive Nash equilibrium seeking algorithm for Euler-Lagrange systems with parameter uncertainty
- Robust distributed Nash equilibrium seeking under switching topologies via fixed-time observer
- Distributed optimal double-layer formation control for multi-cluster systems by a game-based approach
- Distributed Nash equilibrium seeking algorithm with fixed-time convergence for heterogeneous high-order integrator multi-agent systems
This page was built for publication: Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665155)
