  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.

Computer Science and Game Theory