Aggregation Method to Strategy Consensus of Large-Size Networked Evolutionary Matrix Games

The study of large-size networked evolutionary matrix games (NEMGs) with general network structure is a challenging topic due to the inherent complexity of networks. This note analyzes the strategy consensus of large-size NEMGs. The considered large-size NEMG is partitioned into several small-size control subgames via aggregation method. Then, the strategy consensus analysis of large-size NEMGs is converted into the strategy synthesis of small-size control subgames. Based on the strategy profile reachability of each control subgame and the matchable condition between control subgames, a feasible necessary and sufficient condition is presented to verify the strategy consensus of large-size NEMGs.