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

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 consider network aggregative games where each player minimizes a cost function that
depends on its own strategy and on a convex combination of the strategies of its neighbors …

We address the problem to control a population of noncooperative heterogeneous agents,
each with convex cost function depending on the average population state, and all sharing a …

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 design the first fully distributed algorithm for generalized Nash equilibrium seeking in
aggregative games on a time-varying communication network, under partial-decision …