| Abstract: | In this paper, we study the distributed Nash equilibrium (NE) seeking problem for a class of aggregative games with players described by uncertain perturbed nonlinear dynamics. To seek the NE, each player needs to construct a distributed algorithm based on information of its cost function and the exchanging information obtained from its neighbors. By combining the internal model principle and the average consensus technique, we propose a distributed gradient-based algorithm for the players. This paper not only assures the NE seeking of aggregative games but also achieves the disturbance rejection of external disturbances. |
