Computational Economics

, Volume 29, Issue 3, pp 355–367

Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?

Authors

    • School of BusinessDuke University
  • Michael W. Brandt
    • School of BusinessDuke University
    • NBER
Original Paper

DOI: 10.1007/s10614-006-9073-z

Cite this article as:
van Binsbergen, J.H. & Brandt, M.W. Comput Econ (2007) 29: 355. doi:10.1007/s10614-006-9073-z

Abstract

Most dynamic programming methods deployed in the portfolio choice literature involve recursions on an approximated value function. The simulation-based method proposed recently by Brandt, Goyal, Santa-Clara, and Stroud (Review of Financial Studies, 18, 831–873, 2005), relies instead on recursive uses of approximated optimal portfolio weights. We examine the relative numerical performance of these two approaches. We show that when portfolio weights are constrained by short sale restrictions for example, iterating on optimized portfolio weights leads to superior results. Value function iterations result in a lower variance but disproportionately higher bias of the solution, especially when risk aversion is high and the investment horizon is long.

Keywords

Dynamic portfolio choiceSimulation method

Copyright information

© Springer Science+Business Media, LLC 2006