An efficient, and fast convergent algorithm for barrier options
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
261 | en_US |
dc.citation.spage |
251 | en_US |
dc.citation.volume |
4508 | en_US |
dc.contributor.author |
Dai, Tian-Shyr | en_US |
dc.contributor.author |
Lyuu, Yuh-Dauh | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:10:46Z | |
dc.date.available |
2014-12-08T15:10:46Z | |
dc.date.issued |
2007 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.isbn |
978-3-540-72868-9 | en_US |
dc.identifier.issn |
0302-9743 | en_US |
dc.identifier.journal |
Algorithmic Aspects in Information and Management, Proceedings | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8246 | |
dc.identifier.wosnumber |
WOS:000247338600024 | |
dc.language.iso |
en_US | en_US |
dc.subject |
barrier option | en_US |
dc.subject |
combinatorics | en_US |
dc.subject |
option pricing | en_US |
dc.subject |
tree | en_US |
dc.title |
An efficient, and fast convergent algorithm for barrier options | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
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