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, we propose a distributed algorithm for computation of a generalized Nash
equilibrium (GNE) in noncooperative games over networks. We consider games in which the …

We review classic results and recent progress on equilibrium analysis, dynamics, and
optimal interventions in network games with both continuous and discrete strategy sets. We …

How to predict and control the collective decision-making dynamics in networked
populations is of great significance for various applications in engineering, social and …

We consider distributed computation of generalized Nash equilibrium (GNE) over networks,
in games with shared coupling constraints. Existing methods require that each player has …

We design the first fully distributed algorithm for generalized Nash equilibrium seeking in
aggregative games on a time-varying communication network, under partial-decision …

This paper addresses a nonsmooth aggregative game to control multiple noncooperative
players, each with a nonsmooth cost function that depends not only on its own decision but …

We consider strongly monotone games with convex separable coupling constraints, played
by dynamical agents, in a partial-decision information scenario. We start by designing …

The aggregative games of multi-agent systems are studied in this paper, where the players
have second-order nonlinear dynamics with uncertain parameters and the communication …

In this paper, an aggregative game of Euler–Lagrange (EL) systems is investigated, where
the cost functions of all players depend on not only their own decisions but also the …