Generalized Nash equilibrium seeking for networked noncooperative games with a dynamic event-triggered mechanism

Abstract

The generalized Nash equilibrium (GNE) seeking problem of networked noncooperative games is addressed in this paper, where the decision set of each agent is coupled with others via shared constraints. To improve the communication efficiency among agents, a semi-decentralized dynamic event-triggered GNE seeking algorithm is proposed under the full-decision information scenario. Further, considering the partial-decision scenario, where each agent only has the direct interaction with its neighbors via a network, a distributed dynamic event-triggered GNE seeking algorithm is proposed on the basis of a consensus protocol and an operator splitting method. Some sufficient conditions are derived to guarantee the convergence to a variational GNE. Finally, examples on Nash-Cournot games and task allocation games are demonstrated to verify the potential and validity of theoretical results.