Advances in wired and wireless technology have necessitated the development of theory,
models, and tools to cope with the new challenges posed by large-scale control and …

Game theory is the study of decision problems in which there are multiple decision makers
and the quality of a decision maker's choice depends on both that choice and the choices of …

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 …

In decentralized optimization, nodes cooperate to minimize an overall objective function that
is the sum (or average) of per-node private objective functions. Algorithms interleave local …

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 …

We consider a class of Nash games, termed as aggregative games, being played over a
networked system. In an aggregative game, a player's objective is a function of the …

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 …

In this paper, we study a distributed continuous-time design for aggregative games with
coupled constraints in order to seek the generalized Nash equilibrium by a group of agents …

This paper presents an asynchronous gossip-based algorithm for finding a Nash equilibrium
(NE) of a game in a distributed multi-player network. The algorithm is designed in such a …

We present derivative-based necessary and sufficient conditions ensuring player strategies
constitute local Nash equilibria in non-cooperative continuous games. Our results can be …