par Brihaye, Thomas;Goeminne, Aline 
Référence Lecture notes in computer science, 12288 LNCS, page (94-110)
Publication Publié, 2020

Référence Lecture notes in computer science, 12288 LNCS, page (94-110)
Publication Publié, 2020
Article révisé par les pairs
Résumé : | We study multiplayer turn-based timed games with reachability objectives. In particular, we are interested in the notion of subgame perfect equilibrium (SPE). We prove that deciding the constrained existence of an SPE in this setting is EXPTIME-complete. |