  In public transport networks disruptions may occur and lead to travel delays.
It is thus interesting to determine whether a traveler can be resilient to
delays that occur unexpectedly, ensuring that they can reach their destination
in time regardless. We model this as a game between the traveler and a
delay-introducing adversary. We study the computational complexity of the
problem of deciding whether the traveler has a winning strategy in this game.
Our main result is that this problem is PSPACE-complete.

Computational Complexity