Computation of Greeks using Binomial Tree

This paper proposes a new efficient algorithm for the computation of Greeks for options using the binomial tree. We also show that Greeks for European options introduced in this article are asymptotically equivalent to the discrete version of Malliavin Greeks. This fact enables us to show that our Greeks converge to Malliavin Greeks in the continuous time model. The computation algorithms of Greeks for American options using the binomial tree is also given in this article. There are three advantageous points to use binomial tree approach for the computation of Greeks. First, mathematics is much simpler than using the continous time Malliavin calculus approach. Second, we can construct a simple algorithm to obtain the Greeks for American options. Third, this algorithm is very efficient because one can compute the price and Greeks (delta, gamma, vega, and rho) at once. In spite of its importance, only a few previous studies on the computation of Greeks for American options exist, because performing sensitivity analysis for the optimal stopping problem is difficult. We believe that our method will become one of the popular ways to compute Greeks for options.