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 …

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

In this paper, the distributed Nash equilibrium (NE) searching problem is investigated, where
the feasible action sets are constrained by nonlinear inequalities and linear equations …

In this article, we study the distributed generalized Nash equilibrium (GNE) seeking problem
of noncooperative games in dynamic environments. Each player in the game aims to …

We study the Nash equilibrium seeking problem for noncooperative agents whose decision
making process can be modeled as a generalized aggregative game. Specifically, we …

In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game
over generally connected networks. This model differs from a conventional setting in that …

This paper investigates distributed Nash equilibrium seeking in multiagent games under
switching communication topologies. To be specific, the communication topology is …

This paper investigates asynchronous algorithms for distributedly seeking generalized Nash
equilibria with delayed information in multiagent networks. In the game model, a shared …

Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

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 …