Abstract
AbstractThis paper studies continuous-time models for newsvendor problems with dynamic replenishment, financial hedging and Stackelberg competition. These factors are considered simultaneously and the high-dimensional stochastic control models are established. High-dimensional Hamilton-Jacobi-Bellman (HJB) equations are derived for the value functions. To circumvent the curse of dimensionality, a deep learning algorithm is proposed to solve the HJB equations. A projection is introduced in the algorithm to avoid the gradient explosion during the training phase. The deep learning algorithm is implemented for HJB equations derived from the newsvendor models with dimensions up to six. Numerical outcomes validate the algorithm’s accuracy and demonstrate that the high-dimensional stochastic control models can successfully mitigate the risk.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference40 articles.
1. Bach, F. (2017). Breaking the curse of dimensionality with convex neural networks. The Journal of Machine Learning Research, 18, 629–681.
2. Baydin, A. G., Pearlmutter, B. A., Radul, A. A., & Siskind, J. M. (2018). Automatic differentiation in machine learning: A survey. Journal of Machine Learning Research, 18, 1–43.
3. Beck, C. E. W., & Jentzen, A. (2019). Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations. Journal of Nonlinear Science, 29, 1563–1619.
4. Berling, P. (2008). Real options valuation principle in the multi-period base-stock problem. Omega, 36, 1086–1095.
5. Blomvall, J., & Hagenbjörk, J. (2022). Reducing transaction costs for interest rate risk hedging with stochastic programming. European Journal of Operational Research, 302, 1282–1293.