BLACKWELL OPTIMAL STRATEGIES IN PRIORITY MEAN-PAYOFF GAMES

HUGO GIMBERT, WIESŁAW ZIELONKA
2012 International Journal of Foundations of Computer Science  
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. • we can study the iterated limit lim λ 1 →1 . . . lim λ k →1 when discount factors tend to 1 one after
more » ... er (i.e. first we go to 1 with the discount factor λ k associated with some group of states, when the limit is reached then we go to 1 with the next discount factor λ k−1 etc., • another possibility it to examine a simultaneous limit when all factors go to 1 at the same time but with different rates, this will be made precise in Section 4.
doi:10.1142/s0129054112400345 fatcat:3kwfnksbzrcglpjevc4yf77jde