Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10]

@

Journal of Information Science and Engineering, Vol. 28 No. 4, pp. 689-704 (July 2012)

The Complexity of GARCH Option Pricing Models

YING-CHIE CHEN+, YUH-DAUH LYUU AND KUO-WEI WEN
+Department of Finance
Department of Computer Science and Information Engineering
National Taiwan University
Taipei, 106 Taiwan
E-mail: {r95723051@; lyuu@csie.}ntu.edu.tw; wenkuowei@gmail.com

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.

Keywords: GARCH, path dependency, trinomial tree, option pricing, explosion threshold, non-explosion threshold

Full Text () Retrieve PDF document (201207_04.pdf)

Received October 15, 2010; revised December 9, 2010; accepted December 30, 2010.
Communicated by Chi-Jen Lu.