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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bodlaender, H.L., Dinneen, M.J., Khoussainov, B.: On Game-Theoretic Models of Networks. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 550–561. Springer, Heidelberg (2001)
Dinneen, M.J., Khoussainov, B.: Update Games and Update Networks. Journal of Discrete Algorithms 1(1) (2003)
Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How Much Memory is Needed to Win Infinite Games. In: Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, pp. 99–110 (1997)
Emerson, E.A., Jutla, C.S., Sistla, A.P.: On Model Checking for Fragments of μ-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
Ishihara, H., Khoussainov, B.: Complexity of Some Infinite Games Played on Finite Graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 270–281. Springer, Heidelberg (2002)
Mang, Y.C.: Games in open systems verification and synthesis. PhD Thesis, University of California at Berkeley (2002)
McNaughton, R.: Infinite Games Played on Finite Graphs. Annals of Pure and Applied Logic 65, 149–184 (1993)
Nerode, A., Remmel, J., Yakhnis, A.: McNaughton Games and Extracting Strategies for Concurrent Programs. Annals of Pure and Applied Logic 78, 203–242 (1996)
Nerode, A., Yakhnis, A., Yakhnis, V.: Distributed Concurrent Programs as Strategies in Games. In: Logical Methods, pp. 624–653 (1992)
Hunter, P., Dawar, A.: Complexity Bounds for Regular Games. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 495–506. Springer, Heidelberg (2005)
Tarjan, R.: Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Thomas, W.: Infinite games and verification (Extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58–64. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khaliq, I., Khoussainov, B., Liu, J. (2011). Extracting Winning Strategies in Update Games. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-21875-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21874-3
Online ISBN: 978-3-642-21875-0
eBook Packages: Computer ScienceComputer Science (R0)