Linear-time option pricing algorithms by combinatorics

Tian-Shyr Dai, Li Min Liu, Yuh Dauh Lyuu*

*此作品的通信作者

研究成果: Article同行評審

12 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)2142-2157
頁數16
期刊Computers and Mathematics with Applications
55
發行號9
DOIs
出版狀態Published - 1 5月 2008

指紋

深入研究「Linear-time option pricing algorithms by combinatorics」主題。共同形成了獨特的指紋。

引用此