Bounded Parameter Markov Decision Processes with Average Reward Criterion

  • Ambuj Tewari
  • Peter L. Bartlett
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4539)

Abstract

Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, the notion of an optimal policy for a BMDP is not entirely straightforward. We consider two notions of optimality based on optimistic and pessimistic criteria. These have been analyzed for discounted BMDPs. Here we provide results for average reward BMDPs.

We establish a fundamental relationship between the discounted and the average reward problems, prove the existence of Blackwell optimal policies and, for both notions of optimality, derive algorithms that converge to the optimal value function.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Ambuj Tewari
    • 1
  • Peter L. Bartlett
    • 2
  1. 1.University of California, Berkeley, Division of Computer Science, 544 Soda Hall # 1776, Berkeley, CA 94720-1776USA
  2. 2.University of California, Berkeley, Division of Computer Science and Department of Statistics, 387 Soda Hall # 1776, Berkeley, CA 94720-1776USA

Personalised recommendations