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 design a distributed algorithm for learning Nash equilibria over time-varying
communication networks in a partial-decision information scenario, where each agent can …

The design of distributed Nash equilibrium-seeking strategies for games in which the
involved players are of second-order integrator-type dynamics is investigated in this article …

In this paper, we consider the problem of learning a generalized Nash equilibrium (GNE) in
strongly monotone games. First, we propose semi-decentralized and distributed continuous …

In this article, we study the problem of Nash equilibrium (NE) seeking of-player games with
high-order integrator agents over jointly strongly connected networks. The same problem …

In this paper, non-cooperative game problems with individual linear dynamics of players are
addressed. In the case of limited communication resources, event-triggering mechanisms …

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 …

Nash equilibrium computation problems under distributed communication scenarios are
addressed in this paper. In particular, the players, including first-and second-order ones, are …

We consider the Nash equilibrium problem in a partial-decision information scenario.
Specifically, each agent can only receive information from some neighbors via a …