IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0909.3570.html
   My bibliography  Save this paper

On the rates of convergence of simulation based optimization algorithms for optimal stopping problems

Author

Listed:
  • Denis Belomestny

Abstract

In this paper we study simulation based optimization algorithms for solving discrete time optimal stopping problems. This type of algorithms became popular among practioneers working in the area of quantitative finance. Using large deviation theory for the increments of empirical processes, we derive optimal convergence rates and show that they can not be improved in general. The rates derived provide a guide to the choice of the number of simulated paths needed in optimization step, which is crucial for the good performance of any simulation based optimization algorithm. Finally, we present a numerical example of solving optimal stopping problem arising in option pricing that illustrates our theoretical findings.

Suggested Citation

  • Denis Belomestny, 2009. "On the rates of convergence of simulation based optimization algorithms for optimal stopping problems," Papers 0909.3570, arXiv.org.
    • Handle: RePEc:arx:papers:0909.3570
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0909.3570
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. David A. Goldberg & Yilun Chen, 2018. "Polynomial time algorithm for optimal stopping with fixed accuracy," Papers 1807.02227, arXiv.org, revised May 2024.
    2. Christian Bayer & Ra'ul Tempone & Soren Wolfers, 2018. "Pricing American Options by Exercise Rate Optimization," Papers 1809.07300, arXiv.org, revised Aug 2019.

    More about this item

    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:arx:papers:0909.3570. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.