  The game domination number is a graph invariant that arises from a game,
which is related to graph domination in a similar way as the game chromatic
number is related to graph coloring. In this paper we show that verifying
whether the game domination number of a graph is bounded by a given integer is
PSPACE-complete. This contrasts the situation of the game coloring problem
whose complexity is still unknown.
