Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-06T10:50:19.038Z Has data issue: false hasContentIssue false
  • English
  • Français

One-sided solutions for optimal stopping problems with logconcave reward functions

Part of: Stochastic processes Markov processes Sequential methods

Published online by Cambridge University Press:  22 July 2019

Yi-Shen Lin  and
Yi-Ching Yao
Yi-Shen Lin*
Affiliation:
Academia Sinica
Yi-Ching Yao*
Affiliation:
Academia Sinica
*
*Postal address: Institute of Statistical Science, Academia Sinica, 128 Academia Road, Section 2, Nankang, Taipei 11529, Taiwan, ROC.
*Postal address: Institute of Statistical Science, Academia Sinica, 128 Academia Road, Section 2, Nankang, Taipei 11529, Taiwan, ROC.
Get access Rights & Permissions [Opens in a new window]

Abstract

In the literature on optimal stopping, the problem of maximizing the expected discounted reward over all stopping times has been explicitly solved for some special reward functions (including (x+)ν, (ex − K)+, (K − e− x)+, x ∈ ℝ, ν ∈ (0, ∞), and K > 0) under general random walks in discrete time and Lévy processes in continuous time (subject to mild integrability conditions). All such reward functions are continuous, increasing, and logconcave while the corresponding optimal stopping times are of threshold type (i.e. the solutions are one-sided). In this paper we show that all optimal stopping problems with increasing, logconcave, and right-continuous reward functions admit one-sided solutions for general random walks and Lévy processes, thereby generalizing the aforementioned results. We also investigate in detail the principle of smooth fit for Lévy processes when the reward function is increasing and logconcave.

Keywords

American option pricingthreshold typerandom walkLévy processsmooth fit

MSC classification

Primary: 60G40: Stopping times; optimal stopping problems; gambling theory
Secondary: 62L15: Optimal stopping 60J10: Markov chains (discrete-time Markov processes on discrete state spaces) 60J65: Brownian motion

Information

Type
Original Article
Information
Advances in Applied Probability , Volume 51 , Issue 1 , March 2019 , pp. 87 - 115
Copyright
© Applied Probability Trust 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Alili, L. and Kyprianou, A. E. (2005). Some remarks on first passage of Lévy processes, the American put and pasting principles. Ann. Appl. Prob. 15, 2062–2080.CrossRefGoogle Scholar
Bertoin, J. (1996). Lévy Processes. Cambridge University Press.Google Scholar
Boyarchenko, S.I. and Levendorskiǐ, S.Z. (2002). Perpetual American options under Lévy processes. SIAM J. Control Optimization 40, 1663–1696.CrossRefGoogle Scholar
Christensen, S. (2017). An effective method for the explicit solution of sequential problems on the real line. Sequent. Anal. 36, 2–18.CrossRefGoogle Scholar
Christensen, S. and Irle, A. (2017). A general method for finding the optimal threshold in discrete time. Preprint. Available at http://arxiv.org/abs/1710.08250v1.Google Scholar
Christensen, S., Salminen, P. and Ta, B.Q. (2013). Optimal stopping of strong Markov processes. Stoch. Process. Appl. 123, 1138–1159.CrossRefGoogle Scholar
Chung, K. L. (1974). A Course in Probability Theory, 2nd edn. Academic Press, New York.Google Scholar
Darling, D.A., Liggett, T. and Taylor, H.M. (1972). Optimal stopping for partial sums. Ann. Math. Statist. 43, 1363–1368.CrossRefGoogle Scholar
Deligiannidis, G., Le, H. and Utev, S. (2009). Optimal stopping for processes with independent increments, and applications. J. Appl. Prob. 46, 1130–1145.CrossRefGoogle Scholar
Dubins, L.E. and Teicher, H. (1967). Optimal stopping when the future is discounted. Ann. Math. Statist. 38, 601–605.CrossRefGoogle Scholar
Hsiau, S.-R., Lin, Y.-S. and Yao, Y.-C. (2014). Logconcave reward functions and optimal stopping rules of threshold form. Electron. J. Probab. 19, 18pp.CrossRefGoogle Scholar
Kyprianou, A.E. (2014). Fluctuations of Lévy Processes with Applications, 2nd edn. Springer, Heidelberg.CrossRefGoogle Scholar
Kyprianou, A.E. and Surya, B.A. (2005). On the Novikov-Shiryaev optimal stopping problems in continuous time. Electron. Commun. Prob. 10, 146–154.CrossRefGoogle Scholar
Lin, Y.-S. and Yao, Y.-C. (2017). One-sided solutions for optimal stopping problems with logconcave reward functions. Preprint. Available at http://arxiv.org/abs/1710.04339v1.Google Scholar
Mordecki, E. (2002). Optimal stopping and perpetual options for Lévy processes. Finance Stoch. 6, 473–493.CrossRefGoogle Scholar
Mordecki, E. and Mishura, Y. (2016). Optimal stopping for Lévy processes with one-sided solutions. SIAM J. Control Optimization 54, 2553–2567.CrossRefGoogle Scholar
Novikov, A.A. and Shiryaev, A.N. (2005). On an effective case of the solution of the optimal stopping problem for random walks. Theory. Prob. Appl. 49, 344–354.CrossRefGoogle Scholar
Novikov, A. and Shiryaev, A. (2007). On a solution of the optimal stopping problem for processes with independent increments. Stochastics 79, 393–406.CrossRefGoogle Scholar
Peskir, G. (2007). Principle of smooth fit and diffusions with angles. Stochastics 79, 293-302.CrossRefGoogle Scholar
Sato, K.-I. (1999). Lévy Processes and Infinitely Divisible Distributions. Cambridge University Press.Google Scholar
Sheu, Y.-C. and Tsai, M.-Y. (2012). On optimal stopping problems for matrix-exponential jump-diffusion processes. J. Appl. Prob. 49, 531–548.CrossRefGoogle Scholar
Shiryaev, A.N. (1978). Optimal Stopping Rules. Springer, Heidelberg.Google Scholar
Surya, B.A. (2007). An approach for solving perpetual optimal stopping problems driven by Lévy processes. Stochastics 79, 337–361.CrossRefGoogle Scholar