Nash equilibrium, as an essential strategic profile in game theory, is of both practical
relevance and theoretical significance due to its wide penetration into various fields, such as …

In this paper, Nash equilibrium seeking among a network of players is considered. Different
from many existing works on Nash equilibrium seeking in noncooperative games, the …

The aim of this paper is to provide an overview, although unnecessarily complete, of recent
advances in optimal control, optimization, and game theory for networked systems. First, the …

In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over
networks, a setting in which players have limited local information on the others' decisions …

In this paper, we study a distributed continuous-time design for aggregative games with
coupled constraints in order to seek the generalized Nash equilibrium by a group of agents …

This paper is concerned with anti-disturbance Nash equilibrium seeking for games with
partial information. First, reduced-order disturbance observer-based algorithms are …

This paper investigates the distributed strategy design to find generalized Nash equilibria
(GNE) of multi-cluster games with nonsmooth payoff functions, a coupled nonlinear …

In this paper, nonsmooth aggregative games are investigated, where the nondifferentiable
cost function of every player depends on its own decision as well as the aggregate of the …

An N-coalition noncooperative game is formulated in this paper. In the formulated game,
there are N interacting coalitions and each of them includes a set of agents. Each coalition …

An aggregative game with local constraint sets is studied in this article, where each player's
cost function is dependent on the aggregation function that is unavailable to all players. To …