Abstract
It is the aim of this chapter to review some of the algorithmic approaches to the problem of computing winning strategies (resp. of deciding if a player has a winning strategy from a given vertex) in parity games with finite arenas and other two-player games. Parity games are equivalent via linear time reductions to the problem of modal μ-calculus model checking (see Chapters 10 and 9), and this model checking problem plays a major role in computer-aided verification. Furthermore we will see that the problem is not too hard in a complexity-theoretic sense, while no efficient algorithm for it is known so far. Also parity games are the simplest of a whole chain of two-player games for which no efficient solutions are known, further underlining the importance of looking for an efficient algorithm solving this particular problem.
Supported by NSF Grant CCR 9987854.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Klauck, H. (2002). Algorithms for Parity Games. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive