Concurrent games and semi-random determinacy

29 Apr 2018 Roux Stephane Le

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of winning (finite-memory) strategies in finitely many derived one-player games... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • FORMAL LANGUAGES AND AUTOMATA THEORY
  • COMPUTER SCIENCE AND GAME THEORY