@TechReport{	  it:2002-033,
  author	= {Henrik Bj{\"o}rklund and Sven Sandberg and Sergei
		  Vorobyov},
  title		= {Memoryless Determinacy of Parity and Mean Payoff Games: A
		  Simple Proof},
  institution	= {Department of Information Technology, Uppsala University},
  department	= {Computing Science Division},
  year		= {2002},
  number	= {2002-033},
  month		= oct,
  note		= {Updated journal version, March 2003, available at
		  \url{http://www.it.uu.se/research/publications/reports/2002-033/2002-033-journal}}
		  ,
  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
		  [Ehrenfeucht-Mycielski79], our proof does not refer to the
		  infinite-duration versions. Second, we show that the
		  results straightforwardly generalize to infinite duration
		  games.}
}