Computer Science > Formal Languages and Automata Theory
[Submitted on 26 Sep 2017 (v1), last revised 21 Apr 2021 (this version, v7)]
Title:Reachability Switching Games
View PDFAbstract: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.
Submission history
From: Rahul Savani [view email] [via Logical Methods In Computer Science as proxy][v1] Tue, 26 Sep 2017 13:08:13 UTC (29 KB)
[v2] Thu, 22 Feb 2018 19:10:43 UTC (38 KB)
[v3] Thu, 2 May 2019 17:58:28 UTC (40 KB)
[v4] Tue, 25 Aug 2020 16:32:23 UTC (45 KB)
[v5] Thu, 1 Apr 2021 18:49:03 UTC (45 KB)
[v6] Mon, 5 Apr 2021 06:31:38 UTC (50 KB)
[v7] Wed, 21 Apr 2021 17:28:22 UTC (59 KB)
Current browse context:
cs.FL
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.