pith. sign in

arxiv: 1504.07342 · v1 · pith:MHHKIEDCnew · submitted 2015-04-28 · 💻 cs.GT

On Potential Equations of Finite Games

classification 💻 cs.GT
keywords potentialequationsfinitegamegamessomebi-matrixcharacterizations
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.