Event-Triggered Distributed NE Seeking Over Directed Networks

This paper investigates the Nash equilibrium (NE) seeking in non-cooperation games over weight-unbalanced directed networks. By introducing a scalar auxiliary variable and an estimator, the event-triggered distributed NE seeking algorithm is proposed to ensure that all players’ actions converge to NE. Compared with existing NE seeking algorithms, a more general weight-unbalanced directed network is studied in this paper. Besides, both the estimator and auxiliary variable are based on event-triggered mechanisms and hence, the communication frequency among players is reduced and the efficiency of resource utilization is improved. Finally, some numerical simulations are presented to demonstrate the effectiveness of the proposed algorithm.