2015/04/28 by Xinyun Liu, Liu, Xinyun, Jiandong Zhu +1 · 1 citation
Computer Science · Decision Sciences · Physics and Astronomy · #Artificial Intelligence in Games #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #Opinion Dynamics and Social Influence
paper · pdf · doi:10.48550/arxiv.1504.07342
openalex publication_date 2015/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. 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.