Journal of Computational Finance
ISSN:
1460-1559 (print)
1755-2850 (online)
Editor-in-chief: Christoph Reisinger
A new algorithm for constructing implied binomial trees: does the implied model fit any volatility smile?
Yanmin Li
Abstract
ABSTRACT
A new algorithm is proposed for constructing the implied recombining binomial tree. The implied tree built by the method is much more stable and reliable than that constructed using the algorithm of Derman and Kani (1994) and its extensions. Furthermore, it is faster and easier to use. The general properties of the implied model are studied. It is demonstrated that the local volatility function can become singular for certain volatility smiles. The implications of the singularity for the application of the implied model are discussed.
Copyright Infopro Digital Limited. All rights reserved.
As outlined in our terms and conditions, https://www.infopro-digital.com/terms-and-conditions/subscriptions/ (point 2.4), printing is limited to a single copy.
If you would like to purchase additional rights please email info@risk.net
Copyright Infopro Digital Limited. All rights reserved.
You may share this content using our article tools. As outlined in our terms and conditions, https://www.infopro-digital.com/terms-and-conditions/subscriptions/ (clause 2.4), an Authorised User may only make one copy of the materials for their own personal use. You must also comply with the restrictions in clause 2.5.
If you would like to purchase additional rights please email info@risk.net
