A method for pricing American options using semi-infinite linear programming
We introduce a new approach for the numerical pricing of American options. The main idea is to choose a finite number of suitable excessive functions (randomly) and to find the smallest majorant of the gain function in the span of these functions. The resulting problem is a linear semi-infinite programming problem, that can be solved using standard algorithms. This leads to good upper bounds for the original problem. For our algorithms no discretization of space and time and no simulation is necessary. Furthermore it is applicable even for high-dimensional problems. The algorithm provides an approximation of the value not only for one starting point, but for the complete value function on the continuation set, so that the optimal exercise region and e.g. the Greeks can be calculated. We apply the algorithm to (one- and) multidimensional diffusions and to L\'evy processes, and show it to be fast and accurate.
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.:
- 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.
- Martin Lauko & Daniel Sevcovic, 2010. "Comparison of numerical and analytical approximations of the early exercise boundary of the American put option," Papers 1002.0979, arXiv.org, revised Aug 2010.
- Ernesto Mordecki, 2002. "Optimal stopping and perpetual options for Lévy processes," Finance and Stochastics, Springer, vol. 6(4), pages 473-493.
- L. C. G. Rogers, 2002. "Monte Carlo valuation of American options," Mathematical Finance, Wiley Blackwell, vol. 12(3), pages 271-286.
- Christensen, Sören & Irle, Albrecht, 2009. "A note on pasting conditions for the American perpetual optimal stopping problem," Statistics & Probability Letters, Elsevier, vol. 79(3), pages 349-353, February.
- Dayanik, Savas & Karatzas, Ioannis, 2003. "On the optimal stopping problem for one-dimensional diffusions," Stochastic Processes and their Applications, Elsevier, vol. 107(2), pages 173-212, October.
- 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.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1103.4483. 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.