Document Open Access Logo

Reachability Switching Games

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

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2018.124.pdf
  • Filesize: 477 kB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic and verification
Keywords
  • Deterministic Random Walks
  • Model Checking
  • Reachability
  • Simple Stochastic Game
  • Switching Systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani. Reachability Switching Games. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 124:1-124:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.ICALP.2018.124

Author Details

John Fearnley
  • University of Liverpool, UK
Martin Gairing
  • University of Liverpool, UK
Matthias Mnich
  • Universität Bonn, Germany , and Maastricht University, The Netherlands
Rahul Savani
  • University of Liverpool, UK

Funding

  • Mnich, Matthias: Supported by ERC Starting Grant 306465 (BeyondWorstCase) and DFG grant MN 59/4-1.

References

  1. Hoda Akbari and Petra Berenbrink. Parallel rotor walks on finite graphs and applications in discrete load balancing. In Proc. of SPAA, pages 186-195, 2013. Google Scholar
  2. Anne Condon. The complexity of stochastic games. Inf. Comput., 96(2):203-224, 1992. Google Scholar
  3. Joshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer. Deterministic random walks on regular trees. Random Structures Algorithms, 37(3):353-366, 2010. Google Scholar
  4. Joshua Cooper, Benjamin Doerr, Joel Spencer, and Gábor Tardos. Deterministic random walks on the integers. European J. Combin., 28(8):2072-2090, 2007. Google Scholar
  5. Joshua Cooper and Joel Spencer. Simulating a random walk with constant error. Combin. Probab. Comput., 15(6):815-822, 2006. Google Scholar
  6. Benjamin Doerr and Tobias Friedrich. Deterministic random walks on the two-dimensional grid. Combin. Probab. Comput., 18(1-2):123-144, 2009. Google Scholar
  7. Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jiří Matoušek, and Emo Welzl. ARRIVAL: a zero-player graph game in NP∩coNP. In A journey through discrete mathematics, pages 367-374. Springer, Cham, 2017. Google Scholar
  8. John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani. Reachability switching games. CoRR, abs/1709.08991, 2017. URL: http://arxiv.org/abs/1709.08991.
  9. Tobias Friedrich, Martin Gairing, and Thomas Sauerwald. Quasirandom load balancing. SIAM J. Comput., 41(4):747-771, 2012. Google Scholar
  10. Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček, Karel Král, Hagar Mosaad, and Veronika Slívová. ARRIVAL: Next stop in CLS. In Proc. of ICALP, 2018. To appear. Google Scholar
  11. Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Limits to parallel computation: P-completeness theory. The Clarendon Press, Oxford University Press, New York, 1995. Google Scholar
  12. Jan Friso Groote and Bas Ploeger. Switching graphs. Internat. J. Found. Comput. Sci., 20(5):869-886, 2009. Google Scholar
  13. Alexander E. Holroyd, Lionel Levine, Karola Mészáros, Yuval Peres, James Propp, and David B. Wilson. Chip-firing and rotor-routing on directed graphs. In In and out of equilibrium. 2, volume 60 of Progr. Probab., pages 331-364. Birkhäuser, Basel, 2008. Google Scholar
  14. Alexander E. Holroyd and James Propp. Rotor walks and Markov chains. In Algorithmic probability and combinatorics, volume 520 of Contemp. Math., pages 105-126. Amer. Math. Soc., Providence, RI, 2010. Google Scholar
  15. Karthik C. S. Did the train reach its destination: The complexity of finding a witness. Inf. Process. Lett., 121:17-21, 2017. Google Scholar
  16. Bastian Katz, Ignaz Rutter, and Gerhard Woeginger. An algorithmic study of switch graphs. Acta Inform., 49(5):295-312, 2012. Google Scholar
  17. Marta Kwiatkowska, Gethin Norman, and David Parker. PRISM 4.0: Verification of probabilistic real-time systems. In Proc. of CAV, pages 585-591, 2011. Google Scholar
  18. Christoph Meinel. Switching graphs and their complexity. In Proc. MFCS 1989, volume 379 of Lecture Notes Comput. Sci., pages 350-359, 1989. Google Scholar
  19. Vyatcheslav B. Priezzhev, Deepak Dhar, Abhishek Dhar, and Supriya Krishnamurthy. Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett., 77(25):5079, 1996. Google Scholar
  20. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley &Sons, Inc., New York, NY, USA, 1st edition, 1994. Google Scholar
  21. Klaus Reinhardt. The simple reachability problem in switch graphs. In Proc. of SOFSEM, pages 461-472, 2009. Google Scholar
  22. Craig A. Tovey. A simplified NP-complete satisfiability problem. Discrete Appl. Math., 8(1):85-89, 1984. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact