Memoryless determinacy of finite parity games: another simple proof

DOI10.1016/J.IPL.2017.11.012MaRDI QIDQ1705645zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Memoryless determinacy of infinite parity games: another simple proof
• Memoryless Determinacy of Parity Games
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Extending finite-memory determinacy to multi-player games
• The complexity of partial-observation stochastic parity games with finite-memory strategies
• A characterization of von Neumann games in terms of memory
• Determinateness of certain almost-Borel games
• scientific article; zbMATH DE number 2222012
• Determinization and memoryless winning strategies

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

Cited in

(3)

• Memoryless Determinacy of Parity Games
• Memoryless determinacy of infinite parity games: another simple proof
• Memoryless determinacy of parity and mean payoff games: a simple proof

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705645)