Memoryless Determinacy of Parity Games

  • Ralf Küsters
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Abstract

In Chapter 2, parity games were introduced and it was claimed that these games are determined and that both players have memoryless winning strategies. The main purpose of this chapter is to provide proofs for this claim.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ralf Küsters
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität zu KielGermany

Personalised recommendations