IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v208y2013i1p309-32010.1007-s10479-012-1073-x.html
   My bibliography  Save this article

(Approximate) iterated successive approximations algorithm for sequential decision processes

Author

Listed:
  • Pelin Canbolat
  • Uriel Rothblum

Abstract

The paper proves the convergence of (Approximate) Iterated Successive Approximations Algorithm for solving infinite-horizon sequential decision processes satisfying the monotone contraction assumption. At every stage of this algorithm, the value function at hand is used as a terminal reward to determine an (approximately) optimal policy for the one-period problem. This policy is then iterated for a (finite or infinite) number of times and the resulting return function is used as the starting value function for the next stage of the scheme. This method generalizes the standard successive approximations, policy iteration and Denardo’s generalization of the latter. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:309-320:10.1007/s10479-012-1073-x
    DOI: 10.1007/s10479-012-1073-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1073-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1073-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Eric V. Denardo & Uriel G. Rothblum, 1983. "Affine Structure and Invariant Policies for Dynamic Programs," Mathematics of Operations Research, INFORMS, vol. 8(3), pages 342-365, August.
    2. Dimitri P. Bertsekas & Huizhen Yu, 2012. "Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 66-94, February.
    3. Martin L. Puterman & Moon Chirl Shin, 1978. "Modified Policy Iteration Algorithms for Discounted Markov Decision Problems," Management Science, INFORMS, vol. 24(11), pages 1127-1137, July.
    4. 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.
    5. Evan L. Porteus, 1971. "Some Bounds for Discounted Sequential Decision Processes," Management Science, INFORMS, vol. 18(1), pages 7-11, September.
    6. Martin L. Puterman & Shelby L. Brumelle, 1979. "On the Convergence of Policy Iteration in Stationary Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 4(1), pages 60-69, February.
    7. Ward Whitt, 1978. "Approximations of Dynamic Programs, I," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 231-243, August.
    8. Haviv, Moshe, 1985. "Block-successive approximation for a discounted Markov decision model," Stochastic Processes and their Applications, Elsevier, vol. 19(1), pages 151-160, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Abdellatif Semmouri & Mostafa Jourhmane & Zineb Belhallaj, 2020. "Discounted Markov decision processes with fuzzy costs," Annals of Operations Research, Springer, vol. 295(2), pages 769-786, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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. Mercedes Esteban-Bravo & Jose M. Vidal-Sanz & Gökhan Yildirim, 2014. "Valuing Customer Portfolios with Endogenous Mass and Direct Marketing Interventions Using a Stochastic Dynamic Programming Decomposition," Marketing Science, INFORMS, vol. 33(5), pages 621-640, 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.
    4. Heer Burkhard & Maußner Alfred, 2011. "Value Function Iteration as a Solution Method for the Ramsey Model," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 231(4), pages 494-515, August.
    5. Jie Ning & Matthew J. Sobel, 2019. "Easy Affine Markov Decision Processes," Operations Research, INFORMS, vol. 67(6), pages 1719-1737, November.
    6. Phelan, Thomas & Eslami, Keyvan, 2022. "Applications of Markov chain approximation methods to optimal control problems in economics," Journal of Economic Dynamics and Control, Elsevier, vol. 143(C).
    7. Keyvan Eslami & Tom Phelan, 2023. "The Art of Temporal Approximation An Investigation into Numerical Solutions to Discrete and Continuous-Time Problems in Economics," Working Papers 23-10, Federal Reserve Bank of Cleveland.
    8. Oleksandr Shlakhter & Chi-Guhn Lee, 2013. "Accelerated modified policy iteration algorithms for Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 61-76, August.
    9. N. M. Van Dijk & K. Sladký, 1999. "Error Bounds for Nonnegative Dynamic Models," Journal of Optimization Theory and Applications, Springer, vol. 101(2), pages 449-474, May.
    10. Dimitri P. Bertsekas, 2019. "Robust shortest path planning and semicontractive dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 15-37, February.
    11. Ozak, Omer, 2014. "Optimal consumption under uncertainty, liquidity constraints, and bounded rationality," Journal of Economic Dynamics and Control, Elsevier, vol. 39(C), pages 237-254.
    12. Silvia Florio & Wolfgang Runggaldier, 1999. "On hedging in finite security markets," Applied Mathematical Finance, Taylor & Francis Journals, vol. 6(3), pages 159-176.
    13. Johannes Muhle-Karbe & Max Reppen & H. Mete Soner, 2016. "A Primer on Portfolio Choice with Small Transaction Costs," Papers 1612.01302, arXiv.org, revised May 2017.
    14. Paul Zipkin, 2008. "Old and New Methods for Lost-Sales Inventory Systems," Operations Research, INFORMS, vol. 56(5), pages 1256-1263, October.
    15. Wen Li & Song Wang, 2014. "A numerical method for pricing European options with proportional transaction costs," Journal of Global Optimization, Springer, vol. 60(1), pages 59-78, September.
    16. Huizhen Yu & Dimitri Bertsekas, 2013. "Q-learning and policy iteration algorithms for stochastic shortest path problems," Annals of Operations Research, Springer, vol. 208(1), pages 95-132, September.
    17. Victor Aguirregabiria & Arvind Magesan, "undated". "Soultion and Estimation of Dynamic Discrete Choice Structural Models Using Euler Equations," Working Papers 2016-32, Department of Economics, University of Calgary, revised 24 May 2016.
    18. Richard T. Boylan & Bente Villadsen, "undated". "A Bellman's Equation for the Study of Income Smoothing," Computing in Economics and Finance 1996 _009, Society for Computational Economics.
    19. David L. Kaufman & Andrew J. Schaefer, 2013. "Robust Modified Policy Iteration," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 396-410, August.
    20. Festa, Adriano, 2018. "Domain decomposition based parallel Howard’s algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 147(C), pages 121-139.

    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:spr:annopr:v:208:y:2013:i:1:p:309-320:10.1007/s10479-012-1073-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.