We study the Maker-Maker version of the domination game introduced in 2018 by Duch\^ene et al. Given a graph, two players alternately claim vertices. The first player to claim a dominating set of the graph wins. As the Maker-Breaker version, this game is PSPACE-complete on split and bipartite graphs. Our main result is a linear time algorithm to solve this game in forests. We also give a characterization of the cycles where the first player has a winning strategy.
@article{arxiv.2306.05728,
title = {The Maker-Maker domination game in forests},
author = {Eric Duchêne and Arthur Dumas and Nacim Oijid and Aline Parreau and Eric Rémila},
journal= {arXiv preprint arXiv:2306.05728},
year = {2023}
}