Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game

Xianlin Zeng*, Jie Chen, Shu Liang, Yiguang Hong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

103 Citations (Scopus)

Abstract

This paper investigates the distributed strategy design to find generalized Nash equilibria (GNE) of multi-cluster games with nonsmooth payoff functions, a coupled nonlinear inequality constraint, and set constraints. In this game, each cluster is composed of a group of agents and is a virtual noncooperative player, who minimizes its payoff function; each agent only uses its local payoff function, local feasible set and partial information of the coupled inequality constraint, and communicates with its neighbors. To solve the GNE problem, we propose a distributed nonsmooth algorithm using a projected differential inclusion and establish the convergence analysis of the proposed algorithm. A numerical application is given for illustration.

Original languageEnglish
Pages (from-to)20-26
Number of pages7
JournalAutomatica
Volume103
DOIs
Publication statusPublished - May 2019

Keywords

  • Coupled nonlinear inequality constraint
  • Distributed algorithm
  • GNE seeking
  • Multi-cluster game
  • Nonsmooth function
  • Set constraint

Fingerprint

Dive into the research topics of 'Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game'. Together they form a unique fingerprint.

Cite this