Networked Evolutionary Game Analysis on Strategy Consensus Under Pinning Control Based on Degree

This paper studies the strategy consensus problem of networked evolutionary agmes (NEGs) under degree-based pinning control. Firstly, two necessary and sufficient conditions are given for the strategy consensus of NEGs based on different premises. Secondly, an algorithm is obtained to get the minimal-agent control based on degree for making the NEGs achieve the strategy consensus. Thirdly, as application, we present two sufficient conditions for the strategy consensus of NEGs with two kinds of special networked graph: wheel graph and f
n
× 3 flower graph. Finally, an illustrative example is employed to show the effective of the obtained results.