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 consider continuous-time equilibrium seeking in a class of aggregative games with
strongly convex cost functions and affine coupling constraints. We propose simple …

We consider continuous-time equilibrium seeking in monotone aggregative games with
coupling constraints. We propose semi-decentralized integral dynamics and prove their …

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 show that projected-gradient methods for the distributed computation of generalized
Nash equilibria in aggregative games are preconditioned forward-backward splitting …

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 …

This paper considers a networked aggregative game (NAG) where the players are
distributed over a communication network. By only communicating with a subset of players …

This work considers an aggregative game over time-varying graphs, where each player's
cost function depends on its own strategy and the aggregate of its competitors' strategies …

In this paper, we aim to design a distributed approximate algorithm for seeking Nash
equilibria of an aggregative game. Because players' actions are constrained by local …