Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reachability Switching Games   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 $\cap$
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.

18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex