Abstract

In this paper, we study the complexity of deciding which player has a
winning strategy in certain types of McNaughton games. These graph games
can be used as models for computational problems and processes of infinite
duration. We consider the cases (1) where the first player wins when vertices
in a specified set are
... read more