Abstract

In this paper, we propose a deep learning method to solve high-dimensional optimal multiple stopping problems. We represent the policies of multiple stopping problems by the composition of functions. Using the new representation, we approximate the optimal stopping policy recursively with simulation samples. We also derive lower and upper bounds and confidence intervals for the values. Finally, we apply the algorithm to the pricing of swing options, and it produces accurate results in high-dimensional problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.