In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game
over generally connected networks. This model differs from a conventional setting in that …

In this paper, the problem of finding a Nash equilibrium (NE) of a multi-player game is
considered. The players are only aware of their own cost functions as well as the action …

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 study distributed algorithms for finding a Nash equilibrium (NE) in a class of non-
cooperative convex games under partial information. Specifically, each agent has access …

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

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

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 study distributed algorithms for seeking a Nash equilibrium in a class of non-cooperative
games with strongly monotone mappings. Each player has access to her own smooth local …

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

In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over
networks, a setting in which players have limited local information on the others' decisions …