One-Clock Priced Timed Games are PSPACE-hard



Fearnley, John, Ibsen-Jensen, Rasmus and Savani, Rahul ORCID: 0000-0003-1262-7831
(2020) One-Clock Priced Timed Games are PSPACE-hard. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science.

[img] Text
2001.04458v2.pdf - Accepted Version

Download (464kB) | Preview

Abstract

The main result of this paper is that computing the value of a one-clock priced timed game (OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an exponential number of event points. Both results hold even in very restricted classes of games such as DAGs with treewidth three. Finally, we provide a number of positive results, including polynomial-time algorithms for even more restricted classes of OCPTGs such as trees.

Item Type: Article
Uncontrolled Keywords: cs.GT, cs.GT, cs.FL, cs.LO
Depositing User: Symplectic Admin
Date Deposited: 28 Apr 2020 10:26
Last Modified: 10 Aug 2022 21:10
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3084306