Extracting winning strategies in update games

Authors:
Imran Khaliq;Bakhadyr Khoussainov;Jiamou Liu
Affiliations:
Department of Computer Science, University of Auckland, New Zealand;Department of Computer Science, University of Auckland, New Zealand;School of Computing and Mathematical Sciences, Auckland University of Technology, New Zealand
Venue:
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Year:
2011

Citing 9
Cited 0

Complexity of Some Infinite Games Played on Finite Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Infinite Games and Verification (Extended Abstract of a Tutorial)

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
How much memory is needed to win infinite games?

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Games in open systems verification and synthesis

Games in open systems verification and synthesis
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Update games and update networks

Journal of Discrete Algorithms
On Game-Theoretic Models of Networks

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Complexity bounds for regular games

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates algorithms for extracting winning strategies in two-player games played on finite graphs. We focus on a special class of games called update games. We present a procedure for extracting winning strategies in update games by constructing strategies explicitly. This is based on an algorithm that solves update games in quadratic time. We also show that solving update games with a bounded number of nonkdeterministic nodes takes linear time.