par Filiot, Emmanuel 
;Gentilini, Raffaella ;Raskin, Jean-François
Référence Proceedings - Symposium on Logic in Computer Science, page (422-431), 138033
Publication Publié, 2018-06-01
;Gentilini, Raffaella ;Raskin, Jean-François Référence Proceedings - Symposium on Logic in Computer Science, page (422-431), 138033
Publication Publié, 2018-06-01
Article révisé par les pairs
| Résumé : | In this paper, we study the rational synthesis problem for turn-based multiplayer non zero-sum games played on finite graphs for omega-regular objectives. Rationality is formalized by the concept of Nash equilibrium (NE). Contrary to previous works, we consider here the more general and more practically relevant case where players are imperfectly informed. In sharp contrast with the perfect information case, NE are not guaranteed to exist in this more general setting. This motivates the study of the NE existence problem. We show that this problem is ExpTime-C for parity objectives in the two-player case (even if both players are imperfectly informed) and undecidable for more than 2 players. We then study the rational synthesis problem and show that the problem is also ExpTime-C for two imperfectly informed players and undecidable for more than 3 players. As the rational synthesis problem considers a system (Player 0) playing against a rational environment (composed of k players), we also consider the natural case where only Player 0 is imperfectly informed about the state of the environment (and the environment is considered as perfectly informed). In this case, we show that the ExpTime-C result holds when k is arbitrary but fixed. We also analyse the complexity when k is part of the input. © 2018 ACM. |
