Blackwell Optimal Strategies in Priority Mean-Payoff Games

Hugo Gimbert (1) , Wieslaw Zielonka (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are optimal for priority mean-payoff games establishing a strong link between these two classes.

Domaines: Informatique et théorie des jeux [cs.GT]

Hugo Gimbert, Wieslaw Zielonka. Blackwell Optimal Strategies in Priority Mean-Payoff Games. International Journal of Foundations of Computer Science, 2012, 23 (03), pp.687-711. ⟨10.1142/S0129054112400345⟩. ⟨hal-01006400⟩