Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method
From MaRDI portal
Publication:2063781
DOI10.1016/J.AUTOMATICA.2021.110013zbMath1480.91017arXiv2008.12909OpenAlexW3217547593MaRDI QIDQ2063781
Publication date: 3 January 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.12909
Related Items (2)
Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets ⋮ Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network
Cites Work
- Unnamed Item
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- An operator splitting approach for distributed generalized Nash equilibria computation
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games
- Random gradient-free minimization of convex functions
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Real and Complex Monotone Communication Games
- Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Distributed Nash Equilibrium Seeking With Limited Cost Function Knowledge via a Consensus-Based Gradient-Free Method
- Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Learning Generalized Nash Equilibria in a Class of Convex Games
This page was built for publication: Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method