We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use …
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 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 …
This paper analyzes a class of Stackelberg games where different actors compete for shared resources and a central authority tries to balance the demand through a pricing mechanism …
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 study the Nash equilibrium seeking problem for noncooperative agents whose decision making process can be modeled as a generalized aggregative game. Specifically, we …
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 …