The Complexity of Partial-Observation Parity Games

We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have complete view of the game). We survey the complexity results for the problem of deciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete.

• Type: Journal
• Year: 2010
• Where: LPAR
• Authors: Krishnendu Chatterjee, Laurent Doyen
• Keywords: Automated Reasoning, Game, LPAR 2010, Parity Objectives, Two-player Zero-sum Games