Games with a Weak Adversary

We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games.

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

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

[3]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Igor Walukiewicz,et al.  Distributed Games , 2003, FSTTCS.

[5]  Nathalie Bertrand,et al.  Qualitative Determinacy and Decidability of Stochastic Games with Signals , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[6]  John H. Reif,et al.  Universal games of incomplete information , 1979, STOC.

[7]  Krishnendu Chatterjee,et al.  Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[8]  A. Kechris.  Classical descriptive set theory , 1987 .

[9]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[10]  T. Henzinger,et al.  Stochastic o-regular games , 2007 .

[11]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.

[12]  W. Browder,et al.  Annals of Mathematics , 1889 .

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

[14]  Jean-François Raskin,et al.  A Lattice Theory for Solving Games of Imperfect Information , 2006, HSCC.

[15]  Ramaswamy Ramanujam,et al.  A Communication Based Model for Games of Imperfect Information , 2010, CONCUR.

[16]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[17]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[18]  Thomas A. Henzinger,et al.  Discrete-Time Control for Rectangular Hybrid Automata , 1997, ICALP.

[19]  Krishnendu Chatterjee,et al.  Randomness for Free , 2010, MFCS.

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

[21]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[22]  P. S. Thiagarajan,et al.  Distributed Controller Synthesis for Local Specifications , 2001, ICALP.

[23]  Moshe Tennenholtz,et al.  Distributed Games , 1998, TARK.

[24]  L. Vietoris.  Theorie der endlichen und unendlichen Graphen , 1937 .

[25]  Krishnendu Chatterjee,et al.  The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies , 2014, FoSSaCS.

[26]  John H. Reif,et al.  A dynamic logic of multiprocessing with incomplete information , 1980, POPL '80.

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

[28]  Bernd Finkbeiner,et al.  Coordination Logic , 2010, CSL.

[29]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[30]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[31]  Krishnendu Chatterjee,et al.  Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[32]  Krishnendu Chatterjee,et al.  Simple Stochastic Parity Games , 2003, CSL.

[33]  Krishnendu Chatterjee,et al.  The Complexity of Partial-Observation Parity Games , 2010, LPAR.