Network Navigation with Online Delays is PSPACE-complete

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Depian, Thomas, Kern, Christoph, Röder, Sebastian, Terziadis, Soeren, Wallinger, Markus
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 23.08.2023
Subjects
Public transportation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422