A stochastic dynamic programming approach based on bounded rationality and application to dynamic portfolio choice

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Dynamic portfolio choice is an important problem in finance, but the optimal strategy analysis is difficult when considering multiple stochastic volatility variables such as the stock price, interest rate, and income. Besides, recent research in experimental economics indicates that the agent shows limited attention, considering only the variables with high fluctuations but ignoring those with small ones. By extending the sparse max method, we propose an approach to solve dynamic programming problem with small stochastic volatility and the agent's bounded rationality. This approach considers the agent's behavioral factors and avoids effectively the "Curse of Dimensionality" in a dynamic programming problem with more than a few state variables. We then apply it to Merton dynamic portfolio choice model with stochastic volatility and get a tractable solution. Finally, the numerical analysis shows that the bounded rational agent may pay no attention to the varying equity premium and interest rate with small variance. © 2014 Wenjie Bi et al.

Cite

CITATION STYLE

APA

Bi, W., Tian, L., Liu, H., & Chen, X. (2014). A stochastic dynamic programming approach based on bounded rationality and application to dynamic portfolio choice. Discrete Dynamics in Nature and Society, 2014. https://doi.org/10.1155/2014/840725

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free