A survey on potential evolutionary game and its applications

Abstract

Basic concepts about the finite potential games and the networked evolutionary games (NEGs) are introduced. Some new developments are surveyed, including (i) formulas for verifying whether a finite game is (weighted) potential and for calculating the (weighted) potential function; and (ii) the fundamental network equation and strategy profile dynamics of NEGs. Then some applications are introduced, which include: (i) convergence of NEGs; (ii) congestion control; (iii) distributed coverage of graphs.

Keywords:

• potential function
• Networked Evolutionary Game
• convergence
• congestion control
• distributed coverage of graphs
• semi-tensor product of matrices

Acknowledgements

The paper is based on the plenary talk at CCDC 2014.

Additional information

Funding

This work is supported partly by National Natural Science Foundation (NNSF) of China, [grant numbers 61273013 and 61333001].