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 visited infinitely often and vertices in another specified set are visited finitely often, (2) where the first player wins when exactly those vertices in one of a number of specified disjoint sets are visited infinitely often, and (3) a generalization of these first two cases. We give polynomial time algorithms to determine which player has a winning strategy in each of the games considered. © 2001 Springer Berlin Heidelberg.
CITATION STYLE
Bodlaender, H. L., Dinneen, M. J., & Khoussainov, B. (2001). On game-theoretic models of networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2223 LNCS, pp. 550–561). https://doi.org/10.1007/3-540-45678-3_47
Mendeley helps you to discover research relevant for your work.