The Complexity of GARCH Option Pricing Models
Date Issued
2009
Date
2009
Author(s)
陳盈潔
Abstract
When building trees to price options, we often increase the number of partitions per day, n , to improve accuracy. But increasing n often lowers efficiency. Under LARCH, raising n makes the GARCH tree grow exponentially. Lyuu and Wu (2005) prove that the criteria for explosion and non-explosion under LGARCH depend on n . Surprisingly, not all GARCH models share the same property. This thesis proves that LGARCH, NGARCH, GJR-GARCH, TS-GARCH and TGARCH share this property, but the Heston-Nandi model and VAGRCH do not.
Subjects
path dependency
trinomial tree
option pricing
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R95723051-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):52fd7ca0caed0d08d7fc0e97cc27b09f