Abstract
This paper studies stopping problems of the form $V=\inf_{0 \leq \tau \leq T} \mathbb{E}[U(\frac{\max_{0\le s \le T} Z_s }{Z_\tau})]$ for strictly concave or convex utility functions U in a family of increasing functions satisfying certain conditions, where Z is a geometric Brownian motion and T is the time of the nth jump of a Poisson process independent of Z. We obtain some properties of $V$ and offer solutions for the optimal strategies to follow. This provides us with a technique to build numerical approximations of stopping boundaries for the fixed terminal time optimal stopping problem presented in [J. Du Toit and G. Peskir, Ann. Appl. Probab., 19 (2009), pp. 983--1014].
Highlights
The type of optimal stopping problem which is related to the one studied in this paper has been studied by many authors
For strictly concave or convex utility functions U in a family of increasing functions satisfying certain conditions, where Z is a geometric Brownian motion and T is the time of the nth jump of a Poisson process independent of Z
We obtain some properties of V and offer solutions for the optimal strategies to follow. This provides us with a technique to build numerical approximations of stopping boundaries for the fixed terminal time optimal stopping problem presented in [J
Summary
For strictly concave or convex utility functions U in a family of increasing functions satisfying certain conditions, where Z is a geometric Brownian motion and T is the time of the nth jump of a Poisson process independent of Z. We obtain some properties of V and offer solutions for the optimal strategies to follow. This provides us with a technique to build numerical approximations of stopping boundaries for the fixed terminal time optimal stopping problem presented in [J.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
