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 address the generalized Nash equilibrium seeking problem in a partial-decision
information scenario, where each agent can only exchange information with some …

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 …

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 considers the distributed strategy design for Nash equilibrium (NE) seeking in
multi-cluster games under a partial-decision information scenario. In the considered game …

This paper addresses the problem of distributed Nash equilibrium (NE) seeking in strongly
contractive aggregative multi-population games subject to partial-decision information. In …

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 …

Multi-agent decision problems are typically solved via distributed iterative algorithms, where
the agents only communicate between themselves on a peerto-peer network. Each agent …

In this paper, a timestamp-based projected gradient play is proposed for Nash equilibrium
seeking over communication networks for strongly monotone games. Its difference from the …

This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer
games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data …