@inproceedings{3fd079e63d354080a746348bba324f7e,
title = "Fast pricing of European Asian options with provable accuracy: Single-stock and basket options?",
abstract = "This paper develops three polynomial-time techniques for pricing European Asian options with provably small errors, where the stock prices follow binomial trees or trees of higher-degree. The first technique is the first known Monte Carlo algorithm with analytical error bounds suitable for pricing single-stock options with meaningful confidence and speed. The second technique is a general recursive bucketing- based scheme that enables robust trade-offs between accuracy and run- time. The third technique combines the Fast Fourier Transform with bucketing-based schemes for pricing basket options. This technique is extremely fast, polynomial in the number of days and stocks, and does not add any errors to those already incurred in the companion bucketing scheme.",
author = "Karhan Akcoglu and Kao, {Ming Yang} and Raghavan, {Shuba V.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 9th Annual European Symposium on Algorithms, ESA 2001 ; Conference date: 28-08-2001 Through 31-08-2001",
year = "2001",
doi = "10.1007/3-540-44676-1_34",
language = "English (US)",
isbn = "9783540424932",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "404--415",
editor = "{auf der Heide}, {Friedhelm Meyer}",
booktitle = "Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings",
}