Abstract
Using the semi-tensor product method, this paper investigates the algebraic formulation and strategy consensus for a class of networked evolutionary games (NEGs) with 'unconditional imitation updating rule', and presents a number of new results. First, the given NEG is converted to an algebraic form via the semi-tensor product method, and an algorithm is established to obtain the algebraic expression of the considered game. Second, based on the algebraic form, the behaviours of the players in the given evolutionary games are analysed, and some meaningful results are presented. Finally, the strategy consensus problem is considered by adding a pseudo-player to the game, and a free-type control sequence is designed to make the given NEG reach strategy consensus. The study of an illustrative example shows that the new results obtained in this paper work very well.