Summary
In this paper, an aggregative game of multiagent systems over weight‐balanced digraphs is studied, where the decisions of all players are coupled by linear constraints. Different from the well‐known aggregative games, the dynamics of players are disturbed first‐order linear systems in our problem. In order to seek the variational generalized Nash equilibrium (GNE) of the game, a distributed algorithm is developed via gradient descent, internal model, and dynamic average consensus, where the gradient is for seeking the variational GNE, the internal model is for rejecting the exogenous disturbances, and the dynamic average consensus is for estimating the aggregate of the decisions of all players. The exponential convergence of the algorithm to the variational GNE is analyzed by constructing suitable Lyapunov functions. Finally, the effectiveness of our method is illustrated via two examples.