Relaxed Update and Partition Network Games

Authors:
Hans L. Bodlaender;Michael J. Dinneen;Bakhadyr Khoussainov
Affiliations:
Institute of Information and Computing Sciences, Utrecht University P.O. Box 80.089, 3508 TB, Utrecht, the Netherlands;Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand;Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand
Venue:
Fundamenta Informaticae
Year:
2002

Citing 4
Cited 0

Alternation

Journal of the ACM (JACM)
Control Theory, Modal Logic and Games

Hybrid Systems IV
Update Networks and Their Routing Strategies

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Trees, automata, and games

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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 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.