Sporadic Overtaking Optimality in Markov Decision Problems

János Flesch, Arkadi Predtetchinski, Eilon Solan

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)212-228
Number of pages17
JournalDynamic Games and Applications
Volume7
Issue number2
DOIs
StatePublished - 1 Jun 2017

Keywords

  • Blackwell optimality
  • Markov decision problems
  • Overtaking optimality
  • Sporadic overtaking optimality

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics
  • Economics and Econometrics
  • Statistics and Probability
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Sporadic Overtaking Optimality in Markov Decision Problems'. Together they form a unique fingerprint.

Cite this