IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v30y1982i2p301-318.html
   My bibliography  Save this article

Action Elimination Procedures for Modified Policy Iteration Algorithms

Author

Listed:
  • Martin L. Puterman

    (University of British Columbia, Vancouver, British Columbia)

  • Moon Chirl Shin

    (University of Windsor, Windsor, Ontario)

Abstract

This paper proposes bounds and action elimination procedures for policy iteration and modified policy iteration. Procedures to eliminate nonoptimal actions for one iteration and for all subsequent iterations are presented. The implementation of these procedures is discussed and encouraging computational results are presented.

Suggested Citation

  • Martin L. Puterman & Moon Chirl Shin, 1982. "Action Elimination Procedures for Modified Policy Iteration Algorithms," Operations Research, INFORMS, vol. 30(2), pages 301-318, April.
  • Handle: RePEc:inm:oropre:v:30:y:1982:i:2:p:301-318
    DOI: 10.1287/opre.30.2.301
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.2.301
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.30.2.301?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Herzberg, Meir & Yechiali, Uri, 1996. "A K-step look-ahead analysis of value iteration algorithms for Markov decision processes," European Journal of Operational Research, Elsevier, vol. 88(3), pages 622-636, February.
    2. Pelin Canbolat & Uriel Rothblum, 2013. "(Approximate) iterated successive approximations algorithm for sequential decision processes," Annals of Operations Research, Springer, vol. 208(1), pages 309-320, September.
    3. Dijk, N.M. van, 1989. "Truncation of Markov decision problems with a queueing network overflow control application," Serie Research Memoranda 0065, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:30:y:1982:i:2:p:301-318. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.