Article révisé par les pairs
| Résumé : | In turn-based games played on graphs, the constrained existence problem of equilibria is a well studied problem. This problem is already known to be decidable in P for weak subgame perfect equilibria in Boolean games with Büchi objectives. In this paper, we prove that this problem is P-complete. |
