Frederiksen, Søren Kristoffer Stiil2; Miltersen, Peter Bro2
Parosh Aziz Abdulla, Igor Potapov
1 Department of Computer Science, Science and Technology, Aarhus University2 Department of Computer Science, Science and Technology, Aarhus University
We consider two-player zero-sum finite (but infinite-horizon) stochastic games with limiting average payoffs. We define a family of stationary strategies for Player I parameterized by ε > 0 to be monomial, if for each state k and each action j of Player I in state k except possibly one action, we have that the probability of playing j in k is given by an expression of the form c ε d for some non-negative real number c and some non-negative integer d. We show that for all games, there is a monomial family of stationary strategies that are ε-optimal among stationary strategies. A corollary is that all concurrent reachability games have a monomial family of ε-optimal strategies. This generalizes a classical result of de Alfaro, Henzinger and Kupferman who showed that this is the case for concurrent reachability games where all states have value 0 or 1.
Lecture Notes in Computer Science: 7th International Workshop, Rp 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, 2013, p. 122-134
Main Research Area:
Lecture Notes in Computer Science
International Workshop on Reachability Problems, 2013