Nash Equilibrium Seeking for Graphic Games With Dynamic Event-Triggered Mechanism

In this article, a discrete-time Nash equilibrium (NE) seeking problem is studied for a class of graphic games. In order to reduce the signal transmission frequency between adjacent players, a dynamic event-triggered mechanism is designed. For the purpose of regulating the actions of players to the NE points, a discrete-time NE seeking strategy is designed by only using the local action information. Then, sufficient conditions are provided to ensure that the actions of all players converge to the NE point. Finally, a numerical example of a multisatellite communication coordination problem is given to verify the effectiveness of the proposed NE seeking method.