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 …

Game theory, which studies the cooperation and conflict among multiple rational decision
makers, called players, can be utilized to analyze a large class of engineering systems (for …

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 …

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 …

This letter presents a new distributed algorithm that leverages heavy-ball momentum and a
consensus-based gradient method to find a Nash equilibrium (NE) in a class of non …

Information compression techniques are majorly employed to address the concern of
reducing communication cost over peer-to-peer links. In this paper, we investigate …

This paper is concerned with the distributed Nash equilibrium (NE) computation problem for
non-cooperative games subject to partial-decision information. For the purpose of …

In this letter, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative
convex games with partial-decision information. We propose a distributed algorithm, where …

In this paper, the problem of distributed discrete-time Nash equilibrium computation with
event-triggered communication over directed graphs is studied. Each agent can only receive …