Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes - HAL Accéder directement au contenu
Pré-publication, Document de travail Année : 2016

Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes

Résumé

In several standard models of dynamic programming (gambling houses, MDPs, POMDPs), we prove the existence of a robust notion of value for the infinitely repeated problem, namely the pathwise uniform value. This solves two open problems. First, this shows that for any ǫ > 0, the decision-maker has a pure strategy σ which is ǫ-optimal in any n-stage game, provided that n is big enough (this result was only known for behavior strategies, that is, strategies which use randomization). Second, the strategy σ can be chosen such that under the long-run average payoff criterion, the decision-maker has more than the limit of the n-stage values.
Fichier principal
Vignette du fichier
1505.07495v2.pdf ( 305.22 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01302567, version 1 (14-04-2016)

Identifiants

  • HAL Id : hal-01302567 , version 1
  • ARXIV : 1505.07495

Citer

Xavier Venel, Bruno Ziliotto. Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes. 2016. ⟨hal-01302567⟩

Relations

161 Consultations
54 Téléchargements
Dernière date de mise à jour le 07/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus