Leader-Synchronization Non-Cooperative Game Strategy with Time-delays and SCP

The paper addresses the non-cooperative game leader-synchronization problem with time-delays and gain perturbations. In the non-cooperative game, a stochastic communication protocol (SCP) is implemented to prevent the data collisions among agents. Coping with time-delays, SCP and gain perturbation simultaneously makes it extremely hard to get the accurate payoff value. Then, we resort to an explicit upper bound of payoff value as an alternative optimization objective. By using the linear matrix inequality (LMI)-constrained method, the leader-synchronization strategies form the J ̵̄ -Nash Equilibrium ( J ̵̄ -NE) solution of non-cooperative game. Sufficient conditions are established in the infinite-horizon with hope to guarantee the stability behavior. Finally, a simulation example is used to illustrate the validity of the proposed methodology.