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 …

This article considers distributed Nash equilibrium (NE) seeking of strongly monotone
aggregative games over a multiagent network. Each player can only observe its own …

We design the first fully distributed algorithm for generalized Nash equilibrium seeking in
aggregative games on a time-varying communication network, under partial-decision …

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 study the Nash equilibrium seeking problem for noncooperative agents whose decision
making process can be modeled as a generalized aggregative game. Specifically, we …

Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity
property under a suitable monotonicity assumption, which has been exploited to design …

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

We consider for the first time a stochastic generalized Nash equilibrium problem, ie, with
expected-value cost functions and joint feasibility constraints, under partial-decision …

We consider aggregative games with affine coupling constraints, where agents have partial
information on the aggregate value and can only communicate with neighboring agents. We …

In this paper, we study a distributed continuous-time design for aggregative games with
coupled constraints in order to seek the generalized Nash equilibrium by a group of agents …