One-Clock Priced Timed Games are PSPACE-hard
Computer Science and Game Theory
2020-03-06 v2 Formal Languages and Automata Theory
Logic in Computer Science
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.
Cite
@article{arxiv.2001.04458,
title = {One-Clock Priced Timed Games are PSPACE-hard},
author = {John Fearnley and Rasmus Ibsen-Jensen and Rahul Savani},
journal= {arXiv preprint arXiv:2001.04458},
year = {2020}
}