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 …
D Gadjov, L Pavel - IEEE Transactions on Automatic Control, 2018 - ieeexplore.ieee.org
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 …
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 …
S Grammatico - IEEE Transactions on Automatic Control, 2017 - ieeexplore.ieee.org
We address the problem to control a population of noncooperative heterogeneous agents, each with convex cost function depending on the average population state, and all sharing a …
L Pavel - IEEE Transactions on Automatic Control, 2019 - ieeexplore.ieee.org
We consider distributed computation of generalized Nash equilibrium (GNE) over networks, in games with shared coupling constraints. Existing methods require that each player has …
The aggregative games of multi-agent systems are studied in this paper, where the players have second-order nonlinear dynamics with uncertain parameters and the communication …
Noncooperative game-theoretic tools have been increasingly used to study many important resource allocation problems in communications, networking, smart grids, and portfolio …
AR Romano, L Pavel - IEEE Transactions on Control of …, 2019 - ieeexplore.ieee.org
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 …
Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity property under a suitable monotonicity assumption, which has been exploited to design …