par Brice, Léonard 
;Raskin, Jean-François ;Van Den Bogaard, Marie
Référence Leibniz international proceedings in informatics, 229, 116
Publication Publié, 2022-07-01
;Raskin, Jean-François ;Van Den Bogaard, Marie Référence Leibniz international proceedings in informatics, 229, 116
Publication Publié, 2022-07-01
Article révisé par les pairs
| Résumé : | We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst case complexity was left open. |
