The Normal Play of the Domination Game
Jo\~ao Marcos Brito, Thiago Marcilon, Nicolas Martins, Rudini Sampaio

TL;DR
This paper studies the normal play of the domination game, proving its PSPACE-completeness, characterizing winning strategies on paths and cycles, and providing polynomial algorithms for certain graph classes.
Contribution
It introduces the normal play variant of the domination game, proves its computational complexity, and characterizes winning positions on paths and cycles, extending the understanding of this game.
Findings
Normal domination game is PSPACE-complete on graphs with diameter two.
Alice wins on path P_n iff n is not divisible by 4.
Alice wins on cycle C_n iff n=4k+3.
Abstract
In 2010, Bre\v{s}ar, Klav\v{z}ar and Rall introduced the optimization variant of the graph domination game and the game domination number, which was proved PSPACE-hard by Bre\v{s}ar et al. in 2016. In 2024, Leo Versteegen obtained the celebrated proof of the Conjecture on this variant of the domination game, proposed by Kinnersley, West and Zamani in 2013. In this paper, we investigate for the first time the normal play of the domination game, which we call Normal Domination Game, that is an impartial game where the last to play wins. We first prove that this game is PSPACE-complete even in graphs with diameter two. We also use the Sprague-Grundy theory to prove that Alice (the first player) wins in the path if and only if is not a multiple of , and wins in the cycle if and only if for some integer . Moreover, we obtain a polynomial time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Games and Media
