Perpetually dominating large grids (Q6828306)

In this paper, the authors consider the following game on a graph, called the Eternal Domination game. A team of guard tokens initially occupies a dominating set on a graph \(G\). A rioter then picks a node without a guard on it and attacks it. The guards defend against the attack: one of them has to move to the attacked node, while each remaining one can choose to move to one of his neighboring nodes. The new guards' placement must again be dominating. This attack-defend procedure continues perpetually. The guards win if they can eternally maintain a dominating set against any sequence of attacks, otherwise the rioter wins.\N\NThe authors show that approximately \(\frac {mn} 5\) guards win the game on \(m\times n\) grids.\N\NFor the entire collection see [Zbl 1361.68008].