Distributed event-triggered generalized Nash equilibrium seeking for aggregative games on unbalanced digraphs

Abstract

This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative games with double-integrator agents who communicate with each other on an unbalanced directed graph. An auxiliary variable is introduced to balance the consensus terms in the designed algorithm by estimating the left eigenvector of the Laplacian matrix associated with the zero eigenvalue in a distributed manner. Moreover, an event-triggered broadcasting scheme is proposed to reduce communication loads in the network. It is shown that the proposed communication scheme is free of the Zeno behavior and the asymptotic convergence of the designed algorithm is obtained. Simulation results are demonstrated to validate the proposed methods.