IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v14y2017i2d10.1007_s10287-016-0270-5.html
   My bibliography  Save this article

Numerical solutions to dynamic portfolio problems with upper bounds

Author

Listed:
  • Mark Broadie

    (Columbia University)

  • Weiwei Shen

    (Columbia University)

Abstract

In this paper, we apply value function iteration to solve a multi-period portfolio choice problem. Our problem uses power utility preferences and a vector autoregressive process for the return of a single risky asset. In contrast to the observation in van Binsbergen and Brandt (Comput Econ 29:355–368, 2007) that value function iteration produces inaccurate results, we achieve highly accurate solutions through refining the conventional value function iteration by two innovative ingredients: (1) approximating certainty equivalents of value functions by regression, and (2) taking certainty equivalent transformation on expected value functions in optimization. We illustrate that the new approach offers more accurate results than those exclusively designed for improvement through a Taylor series expansion in Garlappi and Skoulakis (Comput Econ 33:193–207, 2009). In particular, both van Binsbergen and Brandt (Comput Econ 29:355–368, 2007) and Garlappi and Skoulakis (Comput Econ 33:193–207, 2009) comparing their lower bounds with other lower bounds, we more objectively assess our lower bounds by comparing with upper bounds. Negligible gaps between our lower and upper bounds across various parameter sets indicate our proposed lower bound strategy is close to optimal.

Suggested Citation

  • Mark Broadie & Weiwei Shen, 2017. "Numerical solutions to dynamic portfolio problems with upper bounds," Computational Management Science, Springer, vol. 14(2), pages 215-227, April.
  • Handle: RePEc:spr:comgts:v:14:y:2017:i:2:d:10.1007_s10287-016-0270-5
    DOI: 10.1007/s10287-016-0270-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-016-0270-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10287-016-0270-5?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. Leif Andersen & Mark Broadie, 2004. "Primal-Dual Simulation Algorithm for Pricing Multidimensional American Options," Management Science, INFORMS, vol. 50(9), pages 1222-1234, September.
    2. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," The Review of Financial Studies, Society for Financial Studies, vol. 14(1), pages 113-147.
    3. Boyle, Phelim & Broadie, Mark & Glasserman, Paul, 1997. "Monte Carlo methods for security pricing," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1267-1321, June.
    4. Michael W. Brandt & Amit Goyal & Pedro Santa-Clara & Jonathan R. Stroud, 2005. "A Simulation Approach to Dynamic Portfolio Choice with an Application to Learning About Return Predictability," The Review of Financial Studies, Society for Financial Studies, vol. 18(3), pages 831-873.
    5. Kenneth L. Judd, 1998. "Numerical Methods in Economics," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262100711, April.
    6. David B. Brown & James E. Smith, 2014. "Information Relaxations, Duality, and Convex Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 62(6), pages 1394-1415, December.
    7. Robert R. Grauer & Nils H. Hakansson, 1993. "On the Use of Mean-Variance and Quadratic Approximations in Implementing Dynamic Investment Strategies: A Comparison of Returns and Investment Policies," Management Science, INFORMS, vol. 39(7), pages 856-871, July.
    8. Mark Broadie & Weiwei Shen, 2016. "High-Dimensional Portfolio Optimization With Transaction Costs," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 19(04), pages 1-49, June.
    9. Lorenzo Garlappi & Georgios Skoulakis, 2009. "Numerical Solutions to Dynamic Portfolio Problems: The Case for Value Function Iteration using Taylor Approximation," Computational Economics, Springer;Society for Computational Economics, vol. 33(2), pages 193-207, March.
    10. Mark Broadie & Yiping Du & Ciamac C. Moallemi, 2015. "Risk Estimation via Regression," Operations Research, INFORMS, vol. 63(5), pages 1077-1097, October.
    11. Jules Binsbergen & Michael Brandt, 2007. "Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?," Computational Economics, Springer;Society for Computational Economics, vol. 29(3), pages 355-367, May.
    12. Merton, Robert C., 1971. "Optimum consumption and portfolio rules in a continuous-time model," Journal of Economic Theory, Elsevier, vol. 3(4), pages 373-413, December.
    13. Lynch, Anthony W. & Tan, Sinan, 2010. "Multiple Risky Assets, Transaction Costs, and Return Predictability: Allocation Rules and Implications for U.S. Investors," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 45(4), pages 1015-1053, August.
    14. Paul A. Samuelson, 1970. "The Fundamental Approximation Theorem of Portfolio Analysis in terms of Means, Variances and Higher Moments," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 37(4), pages 537-542.
    15. Rust, John, 1996. "Numerical dynamic programming in economics," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 14, pages 619-729, Elsevier.
    16. H. M. Amman & D. A. Kendrick & J. Rust (ed.), 1996. "Handbook of Computational Economics," Handbook of Computational Economics, Elsevier, edition 1, volume 1, number 1.
    17. David B. Brown & James E. Smith & Peng Sun, 2010. "Information Relaxations and Duality in Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 785-801, August.
    18. Martin B. Haugh & Leonid Kogan, 2004. "Pricing American Options: A Duality Approach," Operations Research, INFORMS, vol. 52(2), pages 258-270, April.
    19. Nicholas Barberis, 2000. "Investing for the Long Run when Returns Are Predictable," Journal of Finance, American Finance Association, vol. 55(1), pages 225-264, February.
    20. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," University of California at Los Angeles, Anderson Graduate School of Management qt43n1k4jb, Anderson Graduate School of Management, UCLA.
    21. Lorenzo Garlappi & Georgios Skoulakis, 2010. "Solving Consumption and Portfolio Choice Problems: The State Variable Decomposition Method," The Review of Financial Studies, Society for Financial Studies, vol. 23(9), pages 3346-3400.
    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. Dmytro Ivasiuk, 2019. "An approximate solution for the power utility optimization under predictable returns," Papers 1911.06552, arXiv.org, revised Oct 2021.
    2. Yichen Zhu & Marcos Escobar-Anel & Matt Davison, 2023. "A Polynomial-Affine Approximation for Dynamic Portfolio Choice," Computational Economics, Springer;Society for Computational Economics, vol. 62(3), pages 1177-1213, October.

    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. Mark Broadie & Weiwei Shen, 2016. "High-Dimensional Portfolio Optimization With Transaction Costs," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 19(04), pages 1-49, June.
    2. Rongju Zhang & Nicolas Langren'e & Yu Tian & Zili Zhu & Fima Klebaner & Kais Hamza, 2016. "Dynamic portfolio optimization with liquidity cost and market impact: a simulation-and-regression approach," Papers 1610.07694, arXiv.org, revised Jun 2019.
    3. Michael W. Brandt & Amit Goyal & Pedro Santa-Clara & Jonathan R. Stroud, 2005. "A Simulation Approach to Dynamic Portfolio Choice with an Application to Learning About Return Predictability," The Review of Financial Studies, Society for Financial Studies, vol. 18(3), pages 831-873.
    4. Rongju Zhang & Nicolas Langren'e & Yu Tian & Zili Zhu & Fima Klebaner & Kais Hamza, 2018. "Local Control Regression: Improving the Least Squares Monte Carlo Method for Portfolio Optimization," Papers 1803.11467, arXiv.org, revised Sep 2018.
    5. Jin, Xing & Li, Xun & Tan, Hwee Huat & Wu, Zhenyu, 2013. "A computationally efficient state-space partitioning approach to pricing high-dimensional American options via dimension reduction," European Journal of Operational Research, Elsevier, vol. 231(2), pages 362-370.
    6. Yichen Zhu & Marcos Escobar-Anel & Matt Davison, 2023. "A Polynomial-Affine Approximation for Dynamic Portfolio Choice," Computational Economics, Springer;Society for Computational Economics, vol. 62(3), pages 1177-1213, October.
    7. Björn Bick & Holger Kraft & Claus Munk, 2013. "Solving Constrained Consumption-Investment Problems by Simulation of Artificial Market Strategies," Management Science, INFORMS, vol. 59(2), pages 485-503, June.
    8. Alessio Trivella & Danial Mohseni-Taheri & Selvaprabu Nadarajah, 2023. "Meeting Corporate Renewable Power Targets," Management Science, INFORMS, vol. 69(1), pages 491-512, January.
    9. Fei Cong & Cornelis W. Oosterlee, 2017. "Accurate and Robust Numerical Methods for the Dynamic Portfolio Management Problem," Computational Economics, Springer;Society for Computational Economics, vol. 49(3), pages 433-458, March.
    10. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    11. Denis Belomestny & Grigori Milstein & Vladimir Spokoiny, 2009. "Regression methods in pricing American and Bermudan options using consumption processes," Quantitative Finance, Taylor & Francis Journals, vol. 9(3), pages 315-327.
    12. Belomestny, Denis & Milstein, Grigori N. & Spokoiny, Vladimir, 2006. "Regression methods in pricing American and Bermudan options using consumption processes," SFB 649 Discussion Papers 2006-051, Humboldt University Berlin, Collaborative Research Center 649: Economic Risk.
    13. Mehlkopf, R.J., 2011. "Risk sharing with the unborn," Other publications TiSEM fe8a8df6-455f-4624-af10-9, Tilburg University, School of Economics and Management.
    14. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    15. Dragos Florin Ciocan & Velibor V. Mišić, 2022. "Interpretable Optimal Stopping," Management Science, INFORMS, vol. 68(3), pages 1616-1638, March.
    16. Steven Kou & Xianhua Peng & Xingbo Xu, 2016. "EM Algorithm and Stochastic Control in Economics," Papers 1611.01767, arXiv.org.
    17. Legendre, François & Togola, Djibril, 2016. "Explicit solutions to dynamic portfolio choice problems: A continuous-time detour," Economic Modelling, Elsevier, vol. 58(C), pages 627-641.
    18. Helin Zhu & Fan Ye & Enlu Zhou, 2015. "Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes," Quantitative Finance, Taylor & Francis Journals, vol. 15(11), pages 1885-1900, November.
    19. Gamba, Andrea & Tesser, Matteo, 2009. "Structural estimation of real options models," Journal of Economic Dynamics and Control, Elsevier, vol. 33(4), pages 798-816, April.
    20. Mark Broadie & Menghui Cao, 2008. "Improved lower and upper bound algorithms for pricing American options by simulation," Quantitative Finance, Taylor & Francis Journals, vol. 8(8), pages 845-861.

    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:comgts:v:14:y:2017:i:2:d:10.1007_s10287-016-0270-5. 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.