Binomial models for option valuation - examining and improving convergence
Binomial models, which describe the asset price dynamics of the continuous-time model in the limit, serve for approximate valuation of options, especially where formulas cannot be derived analytically due to properties of the considered option type. To evaluate results, one inevitably must understand the convergence properties. In the literature we find various contributions proving convergence of option prices. We examine convergence behaviour and convergence speed. Unfortunately, even in the case of European call options, distorted results occur when calculating prices along the iteration of tree refinements. These convergence patterns are examined and order of convergence one is proven for the Cox-Ross-Rubinstein model as well as for two alternative tree parameter selections from the literature. Furthermore, we define new binomial models, where the calculated option prices converge smoothly to the Black-Scholes solution, and we achieve order of convergence two with much smaller initial error. Notably, only the formulas to determine the up- and down-factors change. Finally, following a recent approach from the literature, all tree approaches are compared with respect to speed and accuracy, calculating the relative root-mean-squared error of approximate option values for a sample of randomly selected parameters across a set of refinements. Here, on average, the same degree of accuracy is achieved 1400 times faster with the new binomial models. We also give some insights into the peculiarities in the valuation of the American put option. Inspecting the numerical results, the approximation of American-type options with the new models exhibits order of convergence one, but with a smaller initial error than with previously existing binomial models, giving the same accuracy on average ten-times faster than previous binomial methods.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 3 (1996)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/RAMF20 |
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RAMF20|
When requesting a correction, please mention this item's handle: RePEc:taf:apmtfi:v:3:y:1996:i:4:p:319-346. 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: (Michael McNulty)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.