We analyse deterministic aggregative games, with large but finite number of players, that are
subject to both local and coupling constraints. Firstly, we derive sufficient conditions for the …

We consider the framework of aggregative games, in which the cost function of each agent
depends on his own strategy and on the average population strategy. As first contribution …

We study the existence and uniqueness of Nash equilibria for a certain class of aggregative
games with finite and possibly large number of players. Sufficient conditions for these are …

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

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 …

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 consider the framework of average aggregative games, where the cost function of each
agent depends on his own strategy and on the average population strategy. We focus on the …

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 consider quasi-aggregative games for large populations of heterogeneous agents,
whose interaction is determined by an underlying communication network. Specifically, each …

In this article, we aim to design a distributed approximate algorithm for seeking Nash
equilibria (NE) of an aggregative game. Due to the local set constraints of each player …