Sporadic Overtaking Optimality in Markov Decision Problems

Printer-friendly version
Article
Author/s: 
János Flesch, Arkadi Predtetchinski, Eilon Solan
Dynamic Games and Applications
Issue number: 
April 2016
Publisher: 
Springer
Year: 
2016
Journal pages: 
1-17
This paper examines a notion of sporadic overtaking optimality in the context of Markov decision problems (MDP). For the class of deterministic MDPs, we prove the existence of pure stationary sporadic overtaking optimal strategies under both the discounted and the average payoff evaluations. Moreover, we examine logical connections between sporadic overtaking optimality and Blackwell optimality. In the class of nondeterministic MDPs, we give examples that admit no sporadic overtaking optimal strategy and discuss a number of alternative definitions of this concept.
Developed by Paolo Gittoi