On dynamic programming: Compactness of the space of policies
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Stochastic Processes and their Applications.
Volume (Year): 3 (1975)
Issue (Month): 4 (October)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Jaśkiewicz, Anna & Matkowski, Janusz & Nowak, Andrzej S., 2011. "Persistently optimal policies in stochastic dynamic programming with generalized discounting," MPRA Paper 31755, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.