A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
From MaRDI portal
Abstract: In this paper we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information. We start from a continuous-time gradient-play dynamics that converges to an NE under strict monotonicity of the pseudo-gradient and assumes perfect information, i.e., instantaneous all-to-all player communication. We consider how to modify this gradient-play dynamics in the case of partial, or networked information between players. We propose an augmented gradient-play dynamics with correction in which players communicate locally only with their neighbours to compute an estimate of the other players' actions. We derive the new dynamics based on the reformulation as a multi-agent coordination problem over an undirected graph. We exploit incremental passivity properties and show that a synchronizing, distributed Laplacian feedback can be designed using relative estimates of the neighbours. Under a strict monotonicity property of the pseudo-gradient, we show that the augmented gradient-play dynamics converges to consensus on the NE of the game. We further discuss two cases that highlight the tradeoff between properties of the game and the communication graph.
Cited in
(64)- Fast generalized Nash equilibrium seeking under partial-decision information
- Learning generalized Nash equilibria in multi-agent dynamical systems via extremum seeking control
- Multi-agent control: a graph-theoretic perspective
- A dynamic extremum seeking scheme for three-player attack-defense with unknown gradient
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Nash equilibrium seeking for individual linear dynamics subject to limited communication resources
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Distributed Nash equilibrium seeking under quantization communication
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Continuous-time convergence rates in potential and monotone games
- Recent advances in optimization and game theoretic control for networked systems
- Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
- Generalized Nash equilibrium seeking for networked noncooperative games with a dynamic event-triggered mechanism
- Algorithm design and approximation analysis on distributed robust game
- Distributed dynamics for aggregative games: Robustness and privacy guarantees
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Distributed Nash equilibrium seeking for high-order integrator dynamics subject to disturbances of unknown bounds
- Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets
- Distributed Nash equilibrium seeking on compact action sets over jointly strongly connected switching networks
- On the convergence of distributed projected gradient play with heterogeneous learning rates in monotone games
- Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management
- Seeking strategy design for distributed nonsmooth games and its application
- Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- Learning generalized Nash equilibria in monotone games: a hybrid adaptive extremum seeking control approach
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- 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 Nash equilibrium seeking with stochastic event-triggered mechanism
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed event-triggered generalized Nash equilibrium seeking in multi-coalition noncooperative games with coupling constraints
- Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs
- Distributed Nash equilibrium seeking for multi-agent systems with uncertainty in the cost function
- Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs
- Distributed Nash equilibrium seeking for quadratic games in discrete-time systems with bounded control inputs
- A delta dissipativity-based framework for generalized Nash equilibrium seeking in population games
- Nash equilibrium seeking for high-order nonlinear MASs under event-triggered communication
- Perfect Bayesian equilibria of two-player games in resilient multiagent systems
- A distributed Nesterov's approach for fast Nash equilibrium seeking in noncooperative games
- Distributed Nash equilibrium seeking for double-integrator multiagent systems via event-triggered communication
- Efficient distributed learning in stochastic non-cooperative games without information exchange
- Distributed Nash equilibrium seeking with a dynamic set of players
- Distributed generalized Nash equilibrium seeking approach via surrogate functions for noncooperative nonconvex games
- Distributed finite-time Nash equilibrium seeking for non-cooperative games
- Distributed adaptive Nash equilibrium seeking for games of heterogeneous high-order players over a directed graph
- Distributed Nash equilibrium seeking with disturbances of unknown frequencies for high-order integrators over jointly strongly connected switching networks
- Stochastic Nash equilibrium seeking for players with linear dynamics
- Passivity of nabla fractional order systems and its application on distributed optimization
- Game-based distributed control for multiple Euler-Lagrange systems over switching topologies
- A timestamp-based Nesterov's accelerated projected gradient method for distributed Nash equilibrium seeking in monotone games
- Distributed aggregative optimization with affine coupling constraints
- Distributed ne and GNE seeking for heterogeneous multi-player games over directed communication networks
- 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
- Asynchronous distributed generalized Nash equilibrium computation for aggregative games with coupling constraint
- On convergence of projected gradient descent with communication noise in monotone games
This page was built for publication: A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629866)
