License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.124
URN: urn:nbn:de:0030-drops-91282
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9128/
Go to the corresponding LIPIcs Volume Portal

Fearnley, John ; Gairing, Martin ; Mnich, Matthias ; Savani, Rahul

Reachability Switching Games

pdf-format:
LIPIcs-ICALP-2018-124.pdf (0.5 MB)

Abstract

In this paper, we study the problem of deciding the winner of reachability switching games. We study zero-, one-, and two-player variants of these 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 n coNP. For the one- and two-player cases, our results hold in both the natural, explicit model and succinctly-represented model. We also study the structure of winning strategies in these games, and in particular we show that exponential memory is required in both the one- and two-player settings.

BibTeX - Entry

@InProceedings{fearnley_et_al:LIPIcs:2018:9128,
  author =	{John Fearnley and Martin Gairing and Matthias Mnich and Rahul Savani},
  title =	{{Reachability Switching Games}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{124:1--124:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9128},
  URN =		{urn:nbn:de:0030-drops-91282},
  doi =		{10.4230/LIPIcs.ICALP.2018.124},
  annote =	{Keywords: Deterministic Random Walks, Model Checking, Reachability, Simple Stochastic Game, Switching Systems}
}

Keywords: Deterministic Random Walks, Model Checking, Reachability, Simple Stochastic Game, Switching Systems
Collection: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 04.07.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI