Distributed Nash Equilibrium Seeking with Preserved Network Connectivity

This paper studies constrained aggregative games over multi-agent systems with network connectivity preservation, where each player's communication capability has a limited range. To solve this problem, a distributed continuous-time algorithm is designed to minimize each player's payoff function and search for the generalized Nash equilibrium. Based on the bounded derivatives and sign function, an improved average tracking dynamic is designed to estimate the average of all players' strategies. In addition, the network connectivity is maintained under the proposed algorithm if the communication network at the initial time is connected. Finally, numerical examples validates the performance of proposed algorithm in heating ventilation air conditioning (HVAC) systems.