IDEAS home Printed from https://ideas.repec.org/p/uts/rpaper/131.html
   My bibliography  Save this paper

On an Effective Solution of the Optimal Stopping Problem for Random Walks

Author

Listed:
  • Alexander Novikov

    (Department of Mathematical Sciences, University of Technology Sydney)

  • Albert Shiryaev

    (Mathematical Institute, Gubkina, Moscow, Russia)

Abstract

We find a solution of the optimal stopping problem for the case when a reward function is an integer function of a random walk on an infinite time interval. It is shown that an optimal stopping time is a first crossing time through a level defined as the largest root of Appell's polynomial associated with the maximum of the random walk. It is also shown that a value function of the optimal stopping problem on the finite interval {0, 1, ? , T} converges with an exponential rate as T approaches infinity to the limit under the assumption that jumps of the random walk are exponentially bounded.

Suggested Citation

  • Alexander Novikov & Albert Shiryaev, 2004. "On an Effective Solution of the Optimal Stopping Problem for Random Walks," Research Paper Series 131, Quantitative Finance Research Centre, University of Technology, Sydney.
    • Handle: RePEc:uts:rpaper:131
    as

    Download full text from publisher

    File URL: http://www.qfrc.uts.edu.au/research/research_papers/rp131.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Svetlana I Boyarchenko & Sergei Z Levendorskii, 2002. "Non-Gaussian Merton-Black-Scholes Theory," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 4955, December.
    2. Zhen Liu & Philippe Nain & Don Towsley, 1999. "Bounds for a class of stochastic recursive equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(2), pages 325-333, April.
    3. Stadje, Wolfgang, 2000. "An iterative approximation procedure for the distribution of the maximum of a random walk," Statistics & Probability Letters, Elsevier, vol. 50(4), pages 375-381, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Belomestny, Denis & Gapeev, Pavel V., 2006. "An iteration procedure for solving integral equations related to optimal stopping problems," SFB 649 Discussion Papers 2006-043, Humboldt University Berlin, Collaborative Research Center 649: Economic Risk.
    2. Christensen, Sören & Salminen, Paavo & Ta, Bao Quoc, 2013. "Optimal stopping of strong Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 123(3), pages 1138-1159.
    3. Boyarchenko, Svetlana & Levendorskii, Sergei, 2010. "Optimal stopping in Levy models, for non-monotone discontinuous payoffs," MPRA Paper 27999, University Library of Munich, Germany.
    4. Jaap H. Abbring, 2012. "Mixed Hitting‐Time Models," Econometrica, Econometric Society, vol. 80(2), pages 783-819, March.
    5. repec:hum:wpaper:sfb649dp2006-043 is not listed on IDEAS
    6. Jaap H. Abbring, 2010. "Identification of Dynamic Discrete Choice Models," Annual Review of Economics, Annual Reviews, vol. 2(1), pages 367-394, September.
    7. Alexander Novikov & Albert Shiryaev, 2006. "On a Solution of the Optimal Stopping Problem for Processes with Independent Increments," Research Paper Series 178, Quantitative Finance Research Centre, University of Technology, Sydney.
    8. Soren Christensen, 2011. "A method for pricing American options using semi-infinite linear programming," Papers 1103.4483, arXiv.org, revised Jun 2011.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leippold, Markus & Vasiljević, Nikola, 2017. "Pricing and disentanglement of American puts in the hyper-exponential jump-diffusion model," Journal of Banking & Finance, Elsevier, vol. 77(C), pages 78-94.
    2. Fotopoulos, Stergios B., 2009. "The geometric convergence rate of the classical change-point estimate," Statistics & Probability Letters, Elsevier, vol. 79(2), pages 131-137, January.
    3. N. Hilber & N. Reich & C. Schwab & C. Winter, 2009. "Numerical methods for Lévy processes," Finance and Stochastics, Springer, vol. 13(4), pages 471-500, September.
    4. Kirkby, J. Lars & Nguyen, Duy, 2021. "Equity-linked Guaranteed Minimum Death Benefits with dollar cost averaging," Insurance: Mathematics and Economics, Elsevier, vol. 100(C), pages 408-428.
    5. Mitya Boyarchenko & Marco De Innocentis & Sergei Levendorskiĭ, 2011. "Prices Of Barrier And First-Touch Digital Options In Lévy-Driven Models, Near Barrier," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 14(07), pages 1045-1090.
    6. Svetlana Boyarchenko & Sergei Levendorskii, 2004. "Real options and the universal bad news principle," Finance 0405011, University Library of Munich, Germany.
    7. Svetlana Boyarchenko & Sergei Levendorskiu{i}, 2019. "Gauge transformations in the dual space, and pricing and estimation in the long run in affine jump-diffusion models," Papers 1912.06948, arXiv.org, revised Dec 2019.
    8. M. Montero, 2008. "Renewal equations for option pricing," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 65(2), pages 295-306, September.
    9. Ole E. Barndorff-Nielsen & Neil Shephard, 2012. "Basics of Levy processes," Economics Papers 2012-W06, Economics Group, Nuffield College, University of Oxford.
    10. Liming Feng & Vadim Linetsky, 2009. "Computing exponential moments of the discrete maximum of a Lévy process and lookback options," Finance and Stochastics, Springer, vol. 13(4), pages 501-529, September.
    11. Svetlana Boyarchenko & Sergei Levendorskiu{i}, 2022. "Efficient inverse $Z$-transform and pricing barrier and lookback options with discrete monitoring," Papers 2207.02858, arXiv.org, revised Jul 2022.
    12. Andrey Itkin & Peter Carr, 2012. "Using Pseudo-Parabolic and Fractional Equations for Option Pricing in Jump Diffusion Models," Computational Economics, Springer;Society for Computational Economics, vol. 40(1), pages 63-104, June.
    13. Dan Pirjol & Lingjiong Zhu, 2023. "Asymptotics for Short Maturity Asian Options in Jump-Diffusion models with Local Volatility," Papers 2308.15672, arXiv.org, revised Feb 2024.
    14. Svetlana Boyarchenko & Sergei Levendorskii, 2023. "Efficient evaluation of joint pdf of a L\'evy process, its extremum, and hitting time of the extremum," Papers 2312.05222, arXiv.org.
    15. JosE Fajardo & Ernesto Mordecki, 2006. "Symmetry and duality in Levy markets," Quantitative Finance, Taylor & Francis Journals, vol. 6(3), pages 219-227.
    16. Svetlana Boyarchenko & Sergei Levendorskiu{i}, 2022. "Efficient evaluation of expectations of functions of a stable L\'evy process and its extremum," Papers 2209.12349, arXiv.org.
    17. Svetlana Boyarchenko & Sergei Levendorski&icaron;, 2007. "Practical Guide To Real Options In Discrete Time," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 48(1), pages 311-342, February.
    18. Liming Feng & Vadim Linetsky, 2008. "Pricing Discretely Monitored Barrier Options And Defaultable Bonds In Lévy Process Models: A Fast Hilbert Transform Approach," Mathematical Finance, Wiley Blackwell, vol. 18(3), pages 337-384, July.
    19. Xu Guo & Yutian Li, 2016. "Valuation of American options under the CGMY model," Quantitative Finance, Taylor & Francis Journals, vol. 16(10), pages 1529-1539, October.
    20. Svetlana Boyarchenko & Sergei Levendorskii, 2023. "Simulation of a L\'evy process, its extremum, and hitting time of the extremum via characteristic functions," Papers 2312.03929, arXiv.org.

    More about this item

    Keywords

    optimal stopping; random walk; rate of convergence; Appell polynomials;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:uts:rpaper:131. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Duncan Ford (email available below). General contact details of provider: https://edirc.repec.org/data/qfutsau.html .

    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.