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.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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|
|Order Information:|| Postal: http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:3:y:1975:i:4:p:345-364. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.