This paper explores aggregative games in a network of general linear systems subject to external disturbances. To deal with external disturbances, distributed strategy-updating rules based on internal model are proposed for the case with perfect and imperfect information, respectively. Different from existing algorithms based on gradient dynamics, by introducing the integral of gradient of cost functions on the basis of passive theory, the rules are proposed to force the strategies of all players to evolve to Nash equilibrium regardless the effect of disturbances. The convergence of the two strategy-updating rules is analyzed via Lyapunov stability theory, passive theory and singular perturbation theory. Simulations are presented to verify ...
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized N...
This thesis studies equilibrium problems in aggregative games. A game describes the interaction amon...
We consider a system of single- or double-integrator agents playing a generalized Nash game over a n...
In this paper, we explore aggregative games over networks of multi-integrator agents with coupled co...
We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregat...
This paper addresses a class of network games played by dynamic agents using their outputs. Unlike m...
The problem of Nash equilibrium seeking is investigated in a networked game. The game is defined as ...
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the co...
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the co...
This paper aims to design a distributed coordination algorithm for solving a multi-agent decision pr...
This paper addresses a class of network games played by dynamic agents using their outputs. Unlike m...
In this paper, continuous-time noncooperative games in networks of double-integrator agents are expl...
We consider the problem of Nash equilibrium seeking (NE) for games with agents subject to exogenous ...
This paper introduces a consensus-based generalized multi-population aggregative game coordination a...
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized N...
This thesis studies equilibrium problems in aggregative games. A game describes the interaction amon...
We consider a system of single- or double-integrator agents playing a generalized Nash game over a n...
In this paper, we explore aggregative games over networks of multi-integrator agents with coupled co...
We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregat...
This paper addresses a class of network games played by dynamic agents using their outputs. Unlike m...
The problem of Nash equilibrium seeking is investigated in a networked game. The game is defined as ...
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the co...
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the co...
This paper aims to design a distributed coordination algorithm for solving a multi-agent decision pr...
This paper addresses a class of network games played by dynamic agents using their outputs. Unlike m...
In this paper, continuous-time noncooperative games in networks of double-integrator agents are expl...
We consider the problem of Nash equilibrium seeking (NE) for games with agents subject to exogenous ...
This paper introduces a consensus-based generalized multi-population aggregative game coordination a...
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized N...
This thesis studies equilibrium problems in aggregative games. A game describes the interaction amon...
We consider a system of single- or double-integrator agents playing a generalized Nash game over a n...