Admissibility in Games with Imperfect Information

In this invited paper, we study the concept of admissible strategies for two player win/lose infinite sequential games with imperfect information. We show that in stark contrast with the perfect information variant, admissible strategies are only guaranteed to exist when players have objectives that are closed sets. As a consequence, we also study decision problems related to the existence of admissible strategies for regular games as well as finite duration games.

[1]  Arno Pauly,et al.  The Computational Complexity of Iterated Elimination of Dominated Strategies , 2016, Theory of Computing Systems.

[2]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[3]  Lorenzo Clemente,et al.  Non-Zero Sum Games for Reactive Synthesis , 2015, LATA.

[4]  Jean-François Raskin,et al.  Assume-admissible synthesis , 2015, Acta Informatica.

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

[6]  Jean-François Raskin,et al.  The complexity of admissibility in Omega-regular games , 2013, CSL-LICS.

[7]  Vincent Conitzer,et al.  Complexity of (iterated) dominance , 2005, EC '05.

[8]  Felix A. Fischer,et al.  On the Complexity of Iterated Weak Dominance in Constant-Sum Games , 2010, Theory of Computing Systems.

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

[10]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.

[11]  Guillermo A. Pérez,et al.  Admissibility in Quantitative Graph Games , 2016, FSTTCS.

[12]  Dietmar Berwanger,et al.  Hierarchical Information Patterns and Distributed Strategy Synthesis , 2015, ATVA.

[13]  Bernd Finkbeiner,et al.  Automatic Compositional Synthesis of Distributed Systems , 2014, FM.

[14]  Christel Baier,et al.  Principles of model checking , 2008 .

[15]  D. Knuth,et al.  A note on strategy elimination in bimatrix games , 1988 .

[16]  Thomas A. Henzinger,et al.  Concurrent reachability games , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Marco Faella,et al.  Admissible Strategies in Infinite Games over Graphs , 2009, MFCS.

[18]  Daniel Kirsten.  Alternating Tree Automata and Parity Games , 2001, Automata, Logics, and Infinite Games.

[19]  Aniello Murano,et al.  Strategy logic with imperfect information , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[20]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[21]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

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