When Can You Play Positionally?

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.

• Type: Conference
• Year: 2004
• Where: MFCS
• Authors: Hugo Gimbert, Wieslaw Zielonka
• Keywords: Infinite Antagonistic Games, MFCS 2004, Payoff Mappings, Popular Payoff Mappings