Memoryless determinacy of parity and mean payoff games: a simple proof
type: Item
instance of: scholarly article
title: Memoryless determinacy of parity and mean payoff games: a simple proof
zbMATH Open document ID: 1098.91027
DOI: 10.1016/S0304-3975(03)00427-4
author: Henrik Björklund
author: Sven Sandberg
author: Sergei Vorobyov
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 2111063
MaRDI profile type: Publication
cites work: Q4418690
cites work: Positional strategies for mean payoff games
cites work: Q3739111
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Q4501540
cites work: Infinite games played on finite graphs
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q2754084
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
cites work: The complexity of mean payoff games on graphs
description: scientific article; zbMATH DE number 2111063