Distributed Nash Equilibrium Seeking for Aggregative Games with Mismatched Disturbances

In this paper, we focus on the distributed Nash equilibrium seeking problem for aggregative games for players described by double-integrator dynamics. Each player in the game is subject to unknown mismatched time-varying disturbances. To solve the Nash equilibrium seeking problem with mismatched disturbances, a distributed Nash equilibrium seeking algorithm is proposed. In aggregative games, the proposed algorithm guarantees the convergence of strategies of players to the Nash equilibrium of aggregative games and suppresses the influence of mismatched disturbances.