On equivalence of state-based potential games

Abstract

In this paper, we explore state-based potential games using the semi-tensor product of matrices. First, applying the potential equation, we derive both a necessary and sufficient condition as well as a sufficient condition to verify whether a state-based game qualifies as a potential game. Next, we present two static equivalence conditions of state-based potential games. We then delve into dynamic equivalence. We propose a criterion that allows us to identify state-based games that are dynamically equivalent to state-based potential games and share similar dynamic properties. Ultimately, we introduce the concept of state-based networked evolutionary games. We provide a necessary and sufficient condition to ensure that a state-based networked evolutionary game can be classified as a state-based potential game.