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.
Acknowledgements
The paper is based on the plenary talk at CCDC 2014.