Advanced Search
MyIDEAS: Login to save this article or follow this journal

On dynamic programming: Compactness of the space of policies


Author Info

  • Schäl, Manfred
Registered author(s):


    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.

    Download Info

    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.
    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    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.

    Bibliographic Info

    Article provided by Elsevier in its journal Stochastic Processes and their Applications.

    Volume (Year): 3 (1975)
    Issue (Month): 4 (October)
    Pages: 345-364

    as in new window
    Handle: RePEc:eee:spapps:v:3:y:1975:i:4:p:345-364

    Contact details of provider:
    Web page:

    Order Information:
    Postal: http://

    Related research

    Keywords: compactness in space of probabilities non-Markovian dynamic programming total reward criterion;


    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. 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.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    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: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.