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

Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency

Author

Listed:
  • Qingyin Ma

    (International School of Economics and Management, Capital University of Economics and Business, Beijing 100070, China)

  • John Stachurski

    (Research School of Economics, Australian National University, Acton, ACT 2601, Australia)

Abstract

Some approaches to solving challenging dynamic programming problems, such as Q-learning, begin by transforming the Bellman equation into an alternative functional equation to open up a new line of attack. Our paper studies this idea systematically with a focus on boosting computational efficiency. We provide a characterization of the set of valid transformations of the Bellman equation, for which validity means that the transformed Bellman equation maintains the link to optimality held by the original Bellman equation. We then examine the solutions of the transformed Bellman equations and analyze correspondingly transformed versions of the algorithms used to solve for optimal policies. These investigations yield new approaches to a variety of discrete time dynamic programming problems, including those with features such as recursive preferences or desire for robustness. Increased computational efficiency is demonstrated via time complexity arguments and numerical experiments.

Suggested Citation

  • Qingyin Ma & John Stachurski, 2021. "Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency," Operations Research, INFORMS, vol. 69(5), pages 1591-1607, September.
    • Handle: RePEc:inm:oropre:v:69:y:2021:i:5:p:1591-1607
    DOI: 10.1287/opre.2020.2006
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.2006
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2020.2006?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
    ---><---

    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:69:y:2021:i:5:p:1591-1607. 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.