IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v11y1998i1d10.1023_a1021659328029.html
   My bibliography  Save this article

Optimal Stopping and Maximal Inequalities for Linear Diffusions

Author

Listed:
  • S. E. Graversen

    (University of Aarhus, Ny Munkegade)

  • G. Peškir

    (University of Aarhus, Ny Munkegade)

Abstract

Given a linear diffusion the solution is found to the optimal stopping problem where the gain is given by the maximum of the process and the cost is proportional to the duration of time. The optimal stopping boundary is shown to be the maximal solution of a nonlinear differential equation expressed in terms of the scale function and the speed measure. Applications to maximal inequalities are indicated.

Suggested Citation

  • S. E. Graversen & G. Peškir, 1998. "Optimal Stopping and Maximal Inequalities for Linear Diffusions," Journal of Theoretical Probability, Springer, vol. 11(1), pages 259-277, January.
    • Handle: RePEc:spr:jotpro:v:11:y:1998:i:1:d:10.1023_a:1021659328029
    DOI: 10.1023/A:1021659328029
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021659328029
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021659328029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gapeev, Pavel V. & Li, Libo, 2022. "Perpetual American standard and lookback options with event risk and asymmetric information," LSE Research Online Documents on Economics 114940, London School of Economics and Political Science, LSE Library.
    2. Pavel V. Gapeev & Peter M. Kort & Maria N. Lavrutich & Jacco J. J. Thijssen, 2022. "Optimal Double Stopping Problems for Maxima and Minima of Geometric Brownian Motions," Methodology and Computing in Applied Probability, Springer, vol. 24(2), pages 789-813, June.
    3. Chen Jia, 2019. "Sharp Moderate Maximal Inequalities for Upward Skip-Free Markov Chains," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1382-1398, September.
    4. János Engländer, 2020. "A Generalization of the Submartingale Property: Maximal Inequality and Applications to Various Stochastic Processes," Journal of Theoretical Probability, Springer, vol. 33(1), pages 506-521, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:11:y:1998:i:1:d:10.1023_a:1021659328029. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.