An efficient, and fast convergent algorithm for barrier options
檔案
本條目沒有附加檔案。
日期
2007
期刊名稱
Algorithmic Aspects in Information and Management, Proceedings
摘要
A barrier option is an option whose payoff depends on whether the price path of the underlying asset ever reaches certain predetermined price levels called the barriers. A single- (double-) barrier option is a barrier option with one (two, respectively) barrier(s). No simple and exact closed-form pricing formula for double-barrier options has been reported in the literature. This paper proposes a novel tree model that can price both single- and double-barrier options efficiently and accurately. This tree model achieves the high efficiency by combinatorial techniques and numerical accuracy by hitting the barriers exactly. Numerical experiments are given to verify the superiority of our method.
所屬典藏
會議論文引用此條目
Dai, T.-S., & Lyuu, Y.-D. (2007). An efficient, and fast convergent algorithm for barrier options. Algorithmic Aspects in Information and Management, Proceedings, 4508, 251–261. https://ir.lib.nycu.edu.tw/handle/11536/8246
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8246