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

We address the generalized Nash equilibrium seeking problem for a population of agents
playing aggregative games with affine coupling constraints. We focus on semi-decentralized …

We address the generalized aggregative equilibrium seeking problem for noncooperative
agents playing average aggregative games with affine coupling constraints. First, we use …

This article considers distributed Nash equilibrium (NE) seeking of strongly monotone
aggregative games over a multiagent network. Each player can only observe its own …

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 …

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, 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 …

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 …

In this note, we address a Nash equilibrium seeking problem for non-cooperative games. In
contrast to previous works on Nash equilibrium seeking, the Nash equilibrium under …

We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games
over networks. We first consider the case where local constraints are present and we design …