Abstract. We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless) optimal strategies. To verify the robustness of our conditions we show that all popular payoff mappings, such as mean payoff, discounted, parity as well as several other payoffs satisfy them.
Gimbert and Zielonka REF studied infinite two-player antagonistic games and give conditions that assure for both players positional (memoryless) optimal strategies.
When can you play positionally
In Mathematical Foundations of Computer Science 2004, volume 3153 of LNCS
Computer Science