On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
From MaRDI portal
Publication:6164028
DOI10.1016/j.automatica.2023.110919zbMath1520.91026arXiv2005.06923MaRDI QIDQ6164028
Publication date: 30 June 2023
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.06923
Nash equilibrium seekingmulti-cluster gamesdistributed projected gradient tracking algorithmpartial-decision information
Related Items (1)
Cites Work
- Unnamed Item
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Methods for task allocation via agent coalition formation
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed Algorithms for Aggregative Games on Graphs
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- Harnessing Smoothness to Accelerate Distributed Optimization
- Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- Distributed Aggregative Optimization Over Multi-Agent Networks
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Distributed continuous‐time algorithm for a general nonsmooth monotropic optimization problem
- Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Generalized Nash equilibrium problems
This page was built for publication: On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
