Linear-time option pricing algorithms by combinatorics

檔案

日期

2008-05-01

期刊名稱

COMPUTERS & MATHEMATICS WITH APPLICATIONS

摘要

Options are popular financial derivatives that play essential roles in financial markets. How to price them efficiently and accurately is very important both in theory and practice. Options are often priced by the lattice model. Although the prices computed by the lattice converge to the theoretical option value under the continuous-time model, they may converge slowly. Worse, for some options like barrier options, the prices can even oscillate wildly. For Such options, huge amounts of computational time are required to achieve acceptable accuracy. Combinatorial techniques have been used to improve the performance in pricing a wide variety of options. This paper uses vanilla options, power options, single-barrier options, double-barrier options, and lookback options as examples to show how combinatorics can help us to derive linear-time pricing algorithms. These algorithms compare favorably against popular lattice methods, which take at least quadratic time. (C) 2007 Elsevier Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Dai, T.-S., Liu, L.-M., & Lyuu, Y.-D. (2008). Linear-time option pricing algorithms by combinatorics. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 55(9), 2142–2157. https://doi.org/10.1016/j.camwa.2007.08.046

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/9372