Semi-tensor product approach for partially symmetric games

In this paper, a criterion for the partially symmetric game (PSG) is derived by using the semi-tensor product approach. The dimension and the basis of the linear subspace composed of all the PSGs with respect to a given set of partial players are calculated. The testing equations with the minimum number are concretely determined, and the computational complexity is analysed. Finally, two examples are displayed to show the theoretical results.