In many practical applications, such as poker, chess, drug interdiction, cybersecurity, and
national defense, players often have adversarial stances, ie, the selfish actions of each …

In this article, we study the multicluster games over weight-balanced digraphs, where the
cost functions of all players are nonsmooth. Besides, in the problem, not only are the …

The distributed Nash equilibrium (NE) seeking problem for multicoalition games has
attracted increasing attention in recent years, but the research mainly focuses on the case …

This brief studies a distributed Nash equilibrium (NE) seeking strategy for a multi-coalition
noncooperative game with local decision sets. In the game model, each coalition consists of …

The decision making and management of many engineering networks involves multiple
parties with conflicting interests, while each party is constituted by multiple agents. Such …

This article investigates the N-coalition games of Euler–Lagrange (EL) systems. In the
games, every coalition consists of a group of players, whose dynamics are formulated as EL …

In this article, we investigate multi-cluster games, where the cost functions of every player
depends on its own decision as well as the decisions of players in other clusters. The …

The work gives a review on the distributed Nash equilibrium seeking of noncooperative
games in multi-agent networks, which emerges as one of the frontier research topics in the …

In this paper, the distributed Nash equilibrium seeking problem of multi-cluster games with
time-varying local cost functions and local strategy set constraints is considered. Agents are …

This paper studies the design of accelerated distributed algorithms for seeking the Nash
Equilibrium (NE) of multiple cluster games over time-varying unbalanced digraphs, where …