Optimal multiple stopping with random waiting times
In the standard models for optimal multiple stopping problems it is assumed that between two exercises there is always a time period of deterministic length $\delta$, the so called refraction period. This prevents the optimal exercise times from bunching up together on top of the optimal stopping time for the one-exercise case. In this article we generalize the standard model by considering random refraction times. We develop the theory and reduce the problem to a sequence of ordinary stopping problems thus extending the results for deterministic times. This requires an extension of the underlying filtrations in general. Furthermore we consider the Markovian case and treat an example explicitly.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Thompson, Andrew C., 1995. "Valuation of Path-Dependent Contingent Claims with Multiple Exercise Decisions over Time: The Case of Take-or-Pay," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 30(02), pages 271-293, June.
- Christian Bender, 2011. "Dual pricing of multi-exercise options under volume constraints," Finance and Stochastics, Springer, vol. 15(1), pages 1-26, January.
- René Carmona & Nizar Touzi, 2008. "Optimal Multiple Stopping And Valuation Of Swing Options," Mathematical Finance, Wiley Blackwell, vol. 18(2), pages 239-268.
- Patrick Jaillet & Ehud I. Ronn & Stathis Tompaidis, 2004. "Valuation of Commodity-Based Swing Options," Management Science, INFORMS, vol. 50(7), pages 909-921, July.
- N. Meinshausen & B. M. Hambly, 2004. "Monte Carlo Methods For The Valuation Of Multiple-Exercise Options," Mathematical Finance, Wiley Blackwell, vol. 14(4), pages 557-583.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1205.1966. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.