Memoryless determinacy of parity and mean payoff games: a simple proof

  • Authors:

  • Henrik Björklund;Sven Sandberg;Sergei Vorobyov

  • Affiliations:

  • Information Technology Department, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden;Information Technology Department, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden;Information Technology Department, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 5.23

Visualization

Abstract

We give a simple, direct, and constructive proof of memoryless determinacy for parity and mean payoff games. First, we prove by induction that the finite duration versions of these games, played until some vertex is repeated, are determined and both players have memoryless winning strategies. In contrast to the proof of Ehrenfeucht and Mycielski, Internat. J. Game Theory, 8 (1979) 109-113, our proof does not refer to the infinite-duration versions. Second, we show that memoryless determinacy straightforwardly generalizes to infinite duration versions of parity and mean payoff games.