Optimal quantization for the pricing of swing options
In this paper, we investigate a numerical algorithm for the pricing of swing options, relying on the so-called optimal quantization method. The numerical procedure is described in details and numerous simulations are provided to assert its efficiency. In particular, we carry out a comparison with the Longstaff-Schwartz algorithm.
|Date of creation:||May 2007|
|Date of revision:|
|Publication status:||Published in Applied Mathematical Finance 16, 1-2 (2009) 183-217|
|Contact details of provider:|| Web page: http://arxiv.org/|
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.:
- repec:dau:papers:123456789/607 is not listed on IDEAS
- 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.
- Bally, Vlad & Pagès, Gilles, 2003. "Error analysis of the optimal quantization algorithm for obstacle problems," Stochastic Processes and their Applications, Elsevier, vol. 106(1), pages 1-40, July.
- Barraquand, Jérôme & Martineau, Didier, 1995. "Numerical Valuation of High Dimensional Multivariate American Securities," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 30(03), pages 383-405, September.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:0705.2110. 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 references are entirely missing, you can add them using this form.