Complexity of the Misère Domination Game on general graphs

Determine whether the Misère Domination Game is PSPACE-complete on general graphs, under the convention that the last player to move loses.

Background

The paper studies the normal-play variant of the Domination Game, in which the last player to move wins. It identifies the corresponding misère variant as an unresolved complexity question and asks whether deciding its winner on general graphs is PSPACE-complete.