par Chatterjee, Krishnendu;Doyen, Laurent 
;Filiot, Emmanuel ;Raskin, Jean-François
Référence Information and computation, 254, 2, page (296-315)
Publication Publié, 2017-06
;Filiot, Emmanuel ;Raskin, Jean-François Référence Information and computation, 254, 2, page (296-315)
Publication Publié, 2017-06
Article révisé par les pairs
| Résumé : | Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games. |
