  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.
