The 1/2-conjecture for the domination game

Let $G$ be a graph with $n$ vertices and minimum degree at least $2$. The game domination number $\gamma_g(G)$ is the number of moves in the domination game when Dominator starts and both players play optimally. The 1/2-conjecture.

$$\gamma_g(G) \leq \left\lceil \frac{1}{2}n \right\rceil.$$

This is the stronger target for graphs without leaves, improving the known general $3n/5$ bound. The paper proves $10n/17+1/17$, which is progress toward the conjecture, but the conjecture remains open.