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.110919zbMATH Open1520.91026arXiv2005.06923MaRDI QIDQ6164028FDOQ6164028
Authors: Min Meng, Xiuxian Li 
Publication date: 30 June 2023
Published in: Automatica (Search for Journal in Brave)
Abstract: This paper considers the distributed strategy design for Nash equilibrium (NE) seeking in multi-cluster games under a partial-decision information scenario. In the considered game, there are multiple clusters and each cluster consists of a group of agents. A cluster is viewed as a virtual noncooperative player that aims to minimize its local payoff function and the agents in a cluster are the actual players that cooperate within the cluster to optimize the payoff function of the cluster through communication via a connected graph. In our setting, agents have only partial-decision information, that is, they only know local information and cannot have full access to opponents' decisions. To solve the NE seeking problem of this formulated game, a discrete-time distributed algorithm, called distributed gradient tracking algorithm (DGT), is devised based on the inter- and intra-communication of clusters. In the designed algorithm, each agent is equipped with strategy variables including its own strategy and estimates of other clusters' strategies. With the help of a weighted Fronbenius norm and a weighted Euclidean norm, theoretical analysis is presented to rigorously show the linear convergence of the algorithm. Finally, a numerical example is given to illustrate the proposed algorithm.
Full work available at URL: https://arxiv.org/abs/2005.06923
Recommendations
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Fast generalized Nash equilibrium seeking under partial-decision information
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
Nash equilibrium seekingmulti-cluster gamesdistributed projected gradient tracking algorithmpartial-decision information
Cites Work
- Generalized Nash equilibrium problems
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed algorithms for aggregative games on graphs
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed continuous-time algorithm for a general nonsmooth monotropic optimization problem
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
- Methods for task allocation via agent coalition formation
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- 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
- Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
- Harnessing Smoothness to Accelerate Distributed Optimization
- Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints
- An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games
- Distributed averaging integral Nash equilibrium seeking on networks
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- Distributed Aggregative Optimization Over Multi-Agent Networks
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
Cited In (11)
- Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Exploring multi-potential games in strategic form: a graph theoretic approach
- Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Fast generalized Nash equilibrium seeking under partial-decision information
- Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs
- Stochastic generalized Nash equilibrium seeking under partial-decision information
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Non-zero sum differential graphical game: cluster synchronisation for multi-agents with partially unknown dynamics
This page was built for publication: On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164028)
