Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2016

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

Abstract

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 le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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

Relations

161 View
54 Download

Altmetric

Share

Gmail Facebook X LinkedIn More