動態規劃的問題並不一定都存在封閉解(closed form solution),即使存在,其過程往往也相當繁雜。本研究擬以 Gerrard & Haberman (2004) 的模型為基礎,並使用逼近動態規劃理論解的數值方法來求解,此方法參考自黃迪揚(2009),其研究探討在有無封閉解的動態規劃下,使用此數值方法求解可以得到
逼近解。本篇嘗試延伸其方法,針對不同類型的限制,做更多不同的變化。Gerrard & Haberman (2004)推導出退休後投資於風險性資產與無風險性資產之最適投資策略封閉解, 本研究欲將模型投資之兩資產衍生至三資產,分別投資在高風險資產、中風險資產與無風險資產,實際市場狀況下禁止買空賣空的情況與風險趨避程度限制資產投資比例所造成的影響。並探討兩資產與三資產下的投資結果,並加入不同的目標函數:使用控制變異數的限制式來降低破產機率、控制帳戶差異部位讓投資更具效率性。雖然加入這些限制式會導致目標函
數過於複雜,但是用此數值方法還是可以得出逼近解。 / Dynamic Programming’s solution is not always a closed form. If it do exist, the solution of progress may be too complicated. Our research is based on the investing model in Gerrard & Haberman (2004), using the numerical solution by Huang (2009) to solve the dynamic programming problem. In his research, he found out that whether dynamic programming problem has the closed form, using the numerical solution to solve the problems, which could get similar result. So in our research, we try to use this solution to solve more complicate problems.
Gerrard & Haberman (2004) derived the closed form solution of optimal investing strategy in post retirement investment plan, investing in risky asset and riskless asset. In this research we try to invest in three assets, investing in high risk asset, middle risk asset and riskless asset. Forbidden short buying and short selling, how risk attitude affect investment behavior in risky asset and riskless asset. We also observe the numerical result of 2 asset and 3 asset, using different objective functions : using variance control to avoid ruin risk, consideration the distance between objective account and actual account to improve investment effective. Although using these restricts may increase the complication of objective functions, but we can use this numerical solution to get the approximating solution.
Identifer | oai:union.ndltd.org:CHENGCHI/G0973580231 |
Creators | 蔡明諺, Tsai, Ming Yen |
Publisher | 國立政治大學 |
Source Sets | National Chengchi University Libraries |
Language | 中文 |
Detected Language | English |
Type | text |
Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0014 seconds