This paper studies an optimal consumption–portfolio problem for an agent with the recursive utility. Chapter 1 focuses on the setting of large numbers of factors and assets. We first characterize optimal consumption-portfolio strategies by forward-backward stochastic differential equations. We propose a new approach based on deep neural networks (DNN), which allows us to solve optimal strategies in a financial market that is comprised of multiple assets efficiently. The accuracy of the new approach is tested by comparing it to the analytical solution when a closed-form solution is available. The efficiency is tested by solving a large-scale problem consisting of dozens of assets. In Chapter 2, we impose a trading constraint on the total position of the portfolio and prove that the DNN based method can also converge to the optimal solution with trading constraints. Based on these results, we provide concrete results about consumption-portfolio plans when trading constraints exist.
| Identifer | oai:union.ndltd.org:bu.edu/oai:open.bu.edu:2144/43569 |
| Date | 11 January 2022 |
| Creators | Lin, Ketong |
| Contributors | Rindisbacher, Marcel, Xing, Hao |
| Source Sets | Boston University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0018 seconds