Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?
- Jules H. van BinsbergenAffiliated withSchool of Business, Duke University Email author
- , Michael W. BrandtAffiliated withSchool of Business, Duke UniversityNBER
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
KeywordsDynamic portfolio choice Simulation method
- Solving dynamic portfolio choice problems by recursing on optimized portfolio weights or on the value function?
Volume 29, Issue 3-4 , pp 355-367
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers-Plenum Publishers
- Additional Links
- Dynamic portfolio choice
- Simulation method
- Industry Sectors