Fast pricing of European Asian options with provable accuracy: Single-stock and basket options?

Karhan Akcoglu, Ming Yang Kao, Shuba V. Raghavan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Pages404-415
Number of pages12
ISBN (Print)9783540424932
DOIs
StatePublished - 2001
Event9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark
Duration: Aug 28 2001Aug 31 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2161
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Annual European Symposium on Algorithms, ESA 2001
Country/TerritoryDenmark
CityArhus
Period8/28/018/31/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Fast pricing of European Asian options with provable accuracy: Single-stock and basket options?'. Together they form a unique fingerprint.

Cite this