透過您的圖書館登入
IP:3.15.156.140

並列摘要


When using trees to price options, the standard practice is to increase the number of partitions per day, n, to improve accuracy. But increasing n incurs computational overhead. In fact, raising n makes the popular Ritchken-Trevor tree under non-linear GARCH (NGARCH) grow exponentially when n exceeds a typically small threshold. Worse, when this happens, the tree cannot grow beyond a certain maturity because of the impossibility of finding valid probabilities. Lyuu and Wu prove the results under NGARCH. They also prove that, by making the tree track the mean value, valid probabilities can always be found if n does not exceed some threshold; furthermore, the growth rate of the tree's size is only quadratic in n. This paper completes that line of research by proving that LGARCH, AGARCH, GJR-GARCH, TS-GARCH and TGARCH share the same properties as NGARCH. The theoretical results are verified by numerical experiments.

被引用紀錄


簡同威(2008)。運用快速傅立葉轉換於具有特徵函數之 選擇權評價模型-台指選擇權之實證〔碩士論文,淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2008.00118
陸天羚(2012)。GARCH模型定價台指選擇權之改善-Generalized Hyperbolic分配的應用〔碩士論文,國立中正大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201613513033

延伸閱讀