On potential equations of finite games

Xinyun Liu ^[1] ; Jiandong Zhu ^[1]
1. [1] Nanjing Normal University
  
  Nanjing Normal University
  
  China
Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 68, 2016, págs. 245-253
Idioma: inglés
Texto completo no disponible (Saber más ...)
Resumen
- In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time. Compared with the existing results, a reduced-complexity testing condition is derived. Some connections between the potential equations and the existing characterizations of potential games are established. It is revealed that a finite game is potential if and only if its every bi-matrix sub-game is potential.