Nash equilibrium, as an essential strategic profile in game theory, is of both practical
relevance and theoretical significance due to its wide penetration into various fields, such as …

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

With the proliferation of distributed generators and energy storage systems, traditional
passive consumers in power systems have been gradually evolving into the so-called …

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 …

We study distributed algorithms for seeking a Nash equilibrium in a class of convex
networked Nash games with strongly monotone map**s. Each player has access to her …

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 …

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 brief, a surplus-based approach is proposed to solve the distributed optimal resource
allocation problem over directed graphs. Two features distinguish our method from the …