A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
From MaRDI portal
Publication:6192954
DOI10.1016/j.automatica.2023.111419OpenAlexW4388742850MaRDI QIDQ6192954
Publication date: 13 February 2024
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2023.111419
distributed Nash equilibrium seekingprojected gradient playjointly strongly connected networksstrongly monotone games
Cites Work
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed robust adaptive equilibrium computation for generalized convex games
- Learning in games with continuous action sets and unknown payoff functions
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Distributed averaging integral Nash equilibrium seeking on networks
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Analysis and Control of Networked Game Dynamics via A Microscopic Deterministic Approach
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- Dynamic NE Seeking for Multi-Integrator Networked Agents With Disturbance Rejection
- Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
- On Gradient-Based Learning in Continuous Games
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
This page was built for publication: A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
