A distributed event-triggered generalized Nash equilibrium seeking algorithm

This paper addresses the problem of seeking generalized Nash equilibrium (GNE) for aggregative games with double-integrator agents by using a small-gain approach. In the existing continuous-time seeking algorithms, a default requirement for algorithms execution is that the interactions among agents be implemented in a continuous-time manner. This paper aims to overcome this weakness and presents an event-triggered communication scheme towards designing a distributed GNE seeking algorithm for agents to arrive at GNE of aggregative games. It is shown that the proposed scheme is free of Zeno behavior. Simulation results are presented to validate the proposed methods.