Fearnley, John
[Verfasser:in];
Gairing, Martin
[Verfasser:in];
Mnich, Matthias
[Verfasser:in];
Savani, Rahul
[Verfasser:in]
;
Technische Universität Hamburg,
Technische Universität Hamburg Institute for Algorithms and Complexity
Anmerkungen:
Sonstige Körperschaft: Technische Universität Hamburg
Sonstige Körperschaft: Technische Universität Hamburg, Institute for Algorithms and Complexity
Beschreibung:
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. For the zero-player case, we also show P-hardness for a succinctly-represented model that maintains the upper bound of NP \ coNP. For the one- and two-player cases, our results hold in both the natural, explicit model and succinctly-represented model. Our results show that the switching variant of a game is harder in complexity-theoretic terms than the corresponding stochastic version.