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 propose a two-layer, semidecentralized algorithm to compute a local solution to the
Stackelberg equilibrium problem in aggregative games with coupling constraints …

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

Several works have recently suggested to model the problem of coordinating the charging
needs of a fleet of electric vehicles as a game, and have proposed distributed algorithms to …

This paper considers Stackelberg equilibrium (SE) and Nash equilibrium (NE) computation
in a class of non-convex network aggregative games with one leader and multiple followers …

Large-scale multi-agent systems arise in several control applications, such as demand side
management in smart power networks, traffic control in intelligent transportation systems …

Abstract In a Stackelberg Pricing Game a distinguished player, the leader, chooses prices
for a set of items, and the other players, the followers, each seek to buy a minimum cost …

We study a Stackelberg game with multiple leaders and a continuum of followers that are
coupled via congestion effects. The followers' problem constitutes a nonatomic congestion …

The $1-N $ generalized Stackelberg game (single-leader multi-follower game) is intricately
intertwined with the interaction between a leader and followers (hierarchical interaction) and …