On the Power of Imperfect Information

We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particular, the reduction shows that the problem of solving imperfect-information games with safety conditions is EXPTIME-complete.

[1]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[2]  Julian C. Bradfield.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[3]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[4]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[5]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Incomplete Information ∗ , 2006 .

[6]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[7]  Helmut Seidl,et al.  On distributive fixed-point expressions , 1999, RAIRO Theor. Informatics Appl..

[8]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[9]  Jeffrey Shallit,et al.  Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.

[10]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[12]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[13]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[14]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[15]  Helmut Seidl.  Fast and Simple Nested Fixpoints , 1996, Inf. Process. Lett..

[16]  Igor Walukiewicz,et al.  Permissive strategies: from parity games to safety games , 2002, RAIRO Theor. Informatics Appl..

[17]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[18]  Giacomo Lenzi.  A Hierarchy Theorem for the µ-Calculus , 1996, ICALP.