Incomplete-profile potential games

The incomplete-profile normal form game (IPNFG), which contains several infeasible profiles, is considered. First, the dynamics of evolutionary IPNFG are presented. Then a method is provided to verify whether an IPNFG is potential. Certain properties of potential IPNFGs are revealed. Next, an algorithm is provided to search the feasible set to guarantee that the corresponding IPNFG is potential. In addition, the decomposition of an IPNFG is investigated. Finally, for an IPNFG with several feasible sets, an algorithm is proposed to find the one which makes the corresponding IPNFG closest to a potential game.