Back to Search
Start Over
Numerical solutions to dynamic portfolio problems with upper bounds
- Source :
- Computational Management Science. 14:215-227
- Publication Year :
- 2017
- Publisher :
- Springer Science and Business Media LLC, 2017.
-
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.
- Subjects :
- Mathematical optimization
050208 finance
05 social sciences
Management Science and Operations Research
Expected value
Upper and lower bounds
Management Information Systems
symbols.namesake
No-arbitrage bounds
Autoregressive model
Bellman equation
0502 economics and business
Taylor series
symbols
Business, Management and Accounting (miscellaneous)
Portfolio
050207 economics
Statistics, Probability and Uncertainty
Value (mathematics)
Mathematics
Subjects
Details
- ISSN :
- 16196988 and 1619697X
- Volume :
- 14
- Database :
- OpenAIRE
- Journal :
- Computational Management Science
- Accession number :
- edsair.doi...........0e1542747ec41be7431f974e49b0abf1
- Full Text :
- https://doi.org/10.1007/s10287-016-0270-5