Memoryless determinacy of finite parity games: another simple proof

DOI10.1016/j.ipl.2017.11.012zbMath1429.91076OpenAlexW2742589611MaRDI QIDQ1705645

Serge Haddad

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01541508/file/main.pdf

zbMATH Keywords

game theoryformal methodsmemoryless determinacy

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (1)

Memoryless determinacy of infinite parity games: another simple proof

Cites Work

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Nearest Fixed Points and Concurrent Priority Games

This page was built for publication: Memoryless determinacy of finite parity games: another simple proof