ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP
Suppose that a train is running along a railway network, starting from a designated origin, with the goal of reaching a designated destination. The network, however, is of a special nature: every time the train traverses a switch, the switch will change its position immediately afterwards. Hence, the next time the train traverses the same switch, the other direction will be taken, so that directions alternate with each traversal of the switch.
Given a network with origin and destination, what is the complexity of deciding whether the train, starting at the origin, will eventually reach the destination?
It is easy to see that this problem can be solved in exponential time, but we are not aware of any polynomial-time method. In this short paper, we prove that the problem is in NP ∩ coNP. This raises the question whether we have just failed to find a (simple) polynomial-time solution, or whether the complexity status is more subtle, as for some other well-known (two-player) graph games (Halman, Algorithmica 49(1):37–50, 2007).
We thank the referees for valuable comments and Rico Zenklusen for constructive discussions.
- 4.C.S. Karthik, Did the train reach its destination: the complexity of finding a witness (2016). https//arxiv.org/abs/1609.03840Google Scholar