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

We design a distributed algorithm for generalized Nash equilibrium seeking in aggregative
games with linear coupling constraints under partial-decision information, ie, the agents …

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

Monotone aggregative games may admit multiple (variational) generalized Nash equilibria,
yet currently there is no algorithm able to provide an a-priori characterization of the …

In this paper, we consider continuous-time semi-decentralized dynamics for the equilibrium
computation in a class of aggregative games. Specifically, we propose a scheme where …

We show that projected-gradient methods for the distributed computation of generalized
Nash equilibria in aggregative games are preconditioned forward-backward splitting …

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 with affine coupling constraints, where
agents have partial information of the aggregate value of the population and can only obtain …