On potential equations of finite games

详细信息    查看全文

• 作者：Xinyun Liu ^{liuxinyun1224@163.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Jiandong Zhu¹ ; ^{zhujiandong@njnu.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Finite game ; Potential game ; Potential equation ; Left semi-tensor product
• 刊名：Automatica
• 出版年：2016
• 出版时间：June 2016
• 年：2016
• 卷：68
• 期：Complete
• 页码：245-253
• 全文大小：604 K

文摘

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.