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 …

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 design a distributed algorithm for learning Nash equilibria over time-varying
communication networks in a partial-decision information scenario, where each agent can …

This paper investigates asynchronous algorithms for distributedly seeking generalized Nash
equilibria with delayed information in multiagent networks. In the game model, a shared …

This article considers a distributed Nash equilibrium seeking problem, where the players
only have partial access to other players' actions, such as their neighbors' actions. Thus, the …

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

This paper studies an N-coalition non-cooperative game problem, where the players in the
same coalition cooperatively minimize the sum of their local cost functions under a directed …

Progress in development of multi-agent control is reviewed. Different approaches for multi-
agent control, estimation, and optimization are discussed in a systematic way with particular …