A Unified Strategy for Solution Seeking in Graphical N-coalition Noncooperative Games
arXiv:1708.02394 · doi:10.1109/TAC.2019.2901820
Abstract
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the -coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is introduced to describe the interactions among the agents in each coalition. 2. The Nash equilibrium seeking strategy is designed with the interference graphs considered. The convergence property of the proposed Nash equilibrium seeking strategy is analytically investigated. It is shown that the agents' actions generated by the proposed method converge to a neighborhood of the Nash equilibrium of the graphical -coalition noncooperative games under certain conditions. Several special cases where there is only one coalition and/or there are coalitions with only one agent are considered. The results for the special cases demonstrate that the proposed seeking strategy achieves the solution seeking for noncooperative games, social cost minimization problems and single-agent optimization problems in a unified framework. Numerical examples are presented to support the theoretical results.
Cited by in corpus (16)
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- Gradient-Free Nash Equilibrium Seeking in N-Cluster Games with Uncoordinated Constant Step-Sizes
- Nash Equilibrium Seeking in N-Coalition Games via a Gradient-Free Method
- Prescribed-Time Fully Distributed Nash Equilibrium Seeking in Noncooperative Games
- Distributed Nash Equilibrium Seeking Algorithm Design for Multi-Cluster Games with High-Order Players
- Gradient-Tracking over Directed Graphs for solving Leaderless Multi-Cluster Games
- Quantized Distributed Gradient Tracking Algorithm with Linear Convergence in Directed Networks
- Adaptive Approaches for Fully Distributed Nash Equilibrium Seeking in Networked Games
- Generalized Nash Equilibrium Seeking Algorithm Design for Distributed Constrained Multi-Cluster Games
- Distributed Generalized Nash Equilibrium Seeking of N-Coalition Games with Full and Distributive Constraints
- Distributed robust seeking of Nash equilibrium for networked games: an extended-state observer based approach
- Distributed Nash Equilibrium Seeking for Games in Systems with Bounded Control Inputs
- Differentially private Nash equilibrium seeking for networked aggregative games
- Distributed Nash Equilibrium Seeking for Games in Systems with Unknown Control Directions
- Distributed Nash Equilibrium Seeking in N-Cluster Games with Fully Uncoordinated Constant Step-Sizes
- Nash Equilibrium Seeking for Games in Second-order Systems without Velocity Measurement