Neurodynamic Approaches for Heterogeneous Multi-coalition Game under Event-triggered Communication

Abstract

This paper addresses the Nash equilibrium seeking problem for multi-coalition games with heterogeneous agent dynamics under limited communication resources. To reduce network overhead and meet real-time decision-making demands, a distributed algorithm integrating event-triggered communication with predefined-time control theory is proposed. Firstly, an event-triggered mechanism with a dynamic threshold is introduced, where agents exchange information only when errors exceed the threshold. Secondly, by incorporating time-varying gains into a leader-follower consensus protocol, the algorithm guarantees that all agents’ strategies converge to the Nash equilibrium within a user-defined time, independent of initial conditions. Using Lyapunov analysis, global predefined-time convergence is rigorously proven, and Zeno behavior is excluded. Finally, numerical examples demonstrate that in complex heterogeneous environments, the proposed method achieves accurate convergence within the preset time while effectively reducing unnecessary communication consumption.