We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on consensus and primal–dual gradient dynamics, to seek a generalized Nash equilibrium in networks of single-integrator agents. Our first solution adopts a fixed gain, whose choice requires the knowledge of some global parameters of the game. To relax this requirement, we conceive a controller that can be tuned in a completely decentralized fashion, thanks to the use of uncoordinated integral adaptive weights. We further introduce algorithms specifically devised for generalized aggregative games. Finally, we ...
We consider multi-agent decision making where each agent's cost function depends on all agents' stra...
We consider continuous-time equilibrium seeking in a class of aggregative games with strongly convex...
We consider the problem to control a large population of noncooperative heterogeneous agents, each w...
We consider a system of single- or double-integrator agents playing a generalized Nash game over a n...
In this paper, we consider the problem of learning a generalized Nash equilibrium (GNE) in strongly ...
We address the generalized Nash equilibrium seeking problem for a population of agents playing aggre...
We consider continuous-time equilibrium seeking in a class of aggregative games with strongly convex...
We consider the problem of distributed Nash equilibrium seeking over networks. In this setting, age...
In this paper, we present three distributed algorithms to solve a class of Generalized Nash Equilibr...
In this paper, we explore aggregative games over networks of multi-integrator agents with coupled co...
We design a distributed algorithm for learning Nash equilibria over time-varying communication netwo...
We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregat...
This paper examines the convergence of a broad class of distributed learning dynamics for games with...
This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative...
We consider multi-agent decision making where each agent's cost function depends on all agents' stra...
We consider continuous-time equilibrium seeking in a class of aggregative games with strongly convex...
We consider the problem to control a large population of noncooperative heterogeneous agents, each w...
We consider a system of single- or double-integrator agents playing a generalized Nash game over a n...
In this paper, we consider the problem of learning a generalized Nash equilibrium (GNE) in strongly ...
We address the generalized Nash equilibrium seeking problem for a population of agents playing aggre...
We consider continuous-time equilibrium seeking in a class of aggregative games with strongly convex...
We consider the problem of distributed Nash equilibrium seeking over networks. In this setting, age...
In this paper, we present three distributed algorithms to solve a class of Generalized Nash Equilibr...
In this paper, we explore aggregative games over networks of multi-integrator agents with coupled co...
We design a distributed algorithm for learning Nash equilibria over time-varying communication netwo...
We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregat...
This paper examines the convergence of a broad class of distributed learning dynamics for games with...
This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative...
We consider multi-agent decision making where each agent's cost function depends on all agents' stra...
We consider continuous-time equilibrium seeking in a class of aggregative games with strongly convex...
We consider the problem to control a large population of noncooperative heterogeneous agents, each w...