ABSTRACT
Networked evolutionary game (NEG) is a kind of games where each player only plays game with its neighbours (such as friends, trading partners) other than all players over networks. The nodes in a network represent players, and the edges represent interaction relationship among players. Hence, players update their strategies according to local information. It has wide applications in many practical fields. This chapter discusses analysis and control problems of NEGs. Firstly, based on myopic best response adjustment rule, the algebraic formulation of NEGs is studied for time invariant network and network with random entrance. Secondly, the convergence of the game dynamics is investigated, including the global convergence and local convergence. Thirdly, by add a control player into the game, the strategy optimization of NEGs is considered, and some necessary and sufficient conditions are proposed to make the game dynamics converge to the best strategy profile.
