We consider distributed computation of generalized Nash equilibrium (GNE) over networks,
in games with shared coupling constraints. Existing methods require that each player has …

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 consider strongly monotone games with convex separable coupling constraints, played
by dynamical agents, in a partial-decision information scenario. We start by designing …

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

An aggregative game with local constraint sets is studied in this article, where each player's
cost function is dependent on the aggregation function that is unavailable to all players. To …

We address the generalized Nash equilibrium seeking problem in a partial-decision
information scenario, where each agent can only exchange information with some …

Generalized games model interactions between a set of selfish decision makers, called
players or agents, where both the objective function and the feasible decision set of each …

We consider continuous-time equilibrium seeking in a class of aggregative games with
strongly convex cost functions and affine coupling constraints. We propose simple …

Noticing that actuator limitations are ubiquitous in practical engineering systems, this article
considers Nash equilibrium seeking for games in systems where the control inputs are …

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 …