Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
From MaRDI portal
Cited in
(20)- 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
- Distributed control of a mobile robot multi-agent system for Nash equilibrium seeking with sampled neighbor information
- Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- A timestamp-based Nesterov's accelerated projected gradient method for distributed Nash equilibrium seeking in monotone games
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- A linearly convergent distributed heavy-ball GNE seeking algorithm for aggregative games over weight-unbalanced digraphs via finite-time consensus
- Distributed local-constraint-satisfied strategy for noncooperative games of autonomous general linear players and its application to smart grids
- Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach
- A distributed Nesterov's approach for fast Nash equilibrium seeking in noncooperative games
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs
- Distributed Nash equilibrium seeking with a dynamic set of players
- Fast generalized Nash equilibrium seeking under partial-decision information
- Evolution of Mixed Strategies in Monotone Games
- Distributed Nash equilibrium seeking for quadratic games in discrete-time systems with bounded control inputs
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
This page was built for publication: Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033823)