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 …

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

In this paper, we consider game problems played by (multi)-integrator agents, subject to
external disturbances. We propose Nash equilibrium seeking dynamics based on gradient …

We design a distributed algorithm for learning Nash equilibria over time-varying
communication networks in a partial-decision information scenario, where each agent can …

In this article, we introduce first-order and zeroth-order Nash equilibrium seeking dynamics
with fixed-time and practical fixed-time convergence certificates for noncooperative games …

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 …

This paper considers the design of fully distributed Nash equilibrium seeking strategies for
networked games. To develop fully distributed seeking strategies, two adaptive control laws …

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

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, Nash equilibrium seeking among a network of players is considered. Different
from many existing works on Nash equilibrium seeking in noncooperative games, the …