Complexity Analysis of One Kinds of Dynamic Games
Huaqin Li · Journal of Guangxi Teachers Education University · 2012
For the complexity of dynamic games with positional winning conditions,it proves that the Strategy Problem for finite games is solvable in polynomial time and the Modle-Checking Game Problem for first order logic is PSPACE-complete.