Infinite cyclic impartial games

Aviezri S. Fraenkel, Ofer Rahat

We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy…