On dynamic programming: Compactness of the space of policies
The compactness of the set of policies in a dynamic programming decision model, which guarantees the existence of an optimal policy, is proven by reducing the problem to the compactness of the set of probability measures which are induced by the policies. When studying the set of probability measures, use is made of the weak topology and the so-called ws[infinity]-topology. A definition and a discussion of the latter topology is given in this paper, where we pay attention to criteria for relative compactness.
Year of publication: |
1975
|
---|---|
Authors: | Schäl, Manfred |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 3.1975, 4, p. 345-364
|
Publisher: |
Elsevier |
Keywords: | compactness in space of probabilities non-Markovian dynamic programming total reward criterion |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
ASYMPTOTIC RESULTS FOR SEQUENTIAL MARKOV DECISION MODELS UNDER UNCERTAINTY
Schäl, Manfred, (1984)
-
Numeraire portfolios and utility-based price systems under proportional transaction costs
Sass, Jörn, (2014)
-
Portfolio optimization and martingale measures
Schäl, Manfred, (2000)
- More ...