Fast accurate binomial pricing
We discuss here an alternative interpretation of the familiar binomial lattice approach to option pricing, illustrating it with reference to pricing of barrier options, one- and two-sided, with fixed, moving or partial barriers, and also the pricing of American put options. It has often been observed that if one tries to price a barrier option using a binomial lattice, then one can find slow convergence to the true price unless care is taken over the placing of the grid points in the lattice; see, for example, the work of Boyle & Lau . The placing of grid points is critical whether one uses a dynamic programming approach, or a Monte Carlo approach, and this can make it difficult to compute hedge ratios, for example. The problems arise from translating a crossing of the barrier for the continuous diffusion process into an event for the binomial approximation. In this article, we show that it is not necessary to make clever choices of the grid positioning, and by interpreting the nature of the binomial approximation appropriately, we are able to derive very quick and accurate pricings of barrier options. The interpretation we give here is applicable much more widely, and helps to smooth out the `odd-even' ripples in the option price as a function of time-to-go which are a common feature of binomial lattice pricing.
Volume (Year): 2 (1997)
Issue (Month): 1 ()
|Note:||received: November 1996; final version received: April 1997|
|Contact details of provider:|| Web page: http://www.springerlink.com/content/101164/|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:finsto:v:2:y:1997:i:1:p:3-17. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.