Admissibility in Games with Imperfect Information

Romain Brenguier (1) , Arno Pauly (2) , Jean-François Raskin (3) , Ocan Sankur (4, 5)

1 Diffblue [Oxford]
2 ULB - Département d'Informatique [Bruxelles]
3 ULB - Université libre de Bruxelles
4 SUMO - SUpervision of large MOdular and distributed systems
5 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires

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.

Mots clés: Formal Models; Admissibility; reactive synthesis; non-zero sum games; imperfect information

Domaines: Informatique [cs]

Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur. Admissibility in Games with Imperfect Information. CONCUR 2017 - 28th International Conference on Concurrency Theory, Sep 2017, Berlin, Germany. pp.2:1-2:23, ⟨10.4230/LIPIcs⟩. ⟨hal-01598152⟩