Reachability Switching Games

In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. 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. In the one- and two-player cases, the problem of determining the winner of a switching game turns out to be much harder than the problem of determining the winner of a Markovian game. We also study the structure of winning strategies in these games, and in particular we show that both players in a two-player reachability switching game require exponential memory.

[1]  Jan Friso Groote,et al.  Switching Graphs , 2008, Electron. Notes Theor. Comput. Sci..

[2]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[3]  Joshua N. Cooper,et al.  Deterministic random walks on regular trees , 2008, SODA '08.

[4]  Tobias Friedrich,et al.  Deterministic Random Walks on the Two-Dimensional Grid , 2009, Comb. Probab. Comput..

[5]  Dhar,et al.  Eulerian Walkers as a Model of Self-Organized Criticality. , 1996, Physical review letters.

[6]  Christoph Meinel.  Switching Graphs and Their Complexity , 1989, MFCS.

[7]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[8]  Gerhard J. Woeginger,et al.  An algorithmic study of switch graphs , 2012, Acta Informatica.

[9]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[10]  Anne Condon,et al.  Computational models of games , 1989, ACM distinguished dissertations.

[11]  Joshua N. Cooper,et al.  Deterministic random walks on the integers , 2007, Eur. J. Comb..

[12]  Manuel Kohler,et al.  ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP , 2017 .

[13]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[14]  Thomas Sauerwald,et al.  Quasirandom load balancing , 2010, SODA '10.

[15]  Hoda Akbari,et al.  Parallel rotor walks on finite graphs and applications in discrete load balancing , 2013, SPAA.

[16]  Joshua N. Cooper,et al.  Simulating a Random Walk with Constant Error , 2004, Combinatorics, Probability and Computing.

[17]  Karel Král,et al.  ARRIVAL: Next Stop in CLS , 2018, ICALP.

[18]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[19]  John Fearnley,et al.  Unique End of Potential Line , 2018, ICALP.

[20]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[21]  S. KarthikC..  Did the train reach its destination: The complexity of finding a witness , 2017, Inf. Process. Lett..

[22]  J. Propp,et al.  Rotor Walks and Markov Chains , 2009, 0904.4507.

[23]  Klaus Reinhardt,et al.  The Simple Reachability Problem in Switch Graphs , 2009, SOFSEM.

[24]  Eylon Yogev,et al.  Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds , 2017, SODA.

[25]  David B. Wilson,et al.  Chip-Firing and Rotor-Routing on Directed Graphs , 2008, 0801.3306.