Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?
Jules van Binsbergen () and
Michael Brandt ()
Computational Economics, 2007, vol. 29, issue 3, 355-367
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. Copyright Springer Science+Business Media, LLC 2007
Keywords: Dynamic portfolio choice; Simulation method (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:kap:compec:v:29:y:2007:i:3:p:355-367
Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2
Access Statistics for this article
Computational Economics is currently edited by Hans Amman
More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla ().