Pricing maximum-minimum bidirectional options in trinomial CEV model

Bin Peng, Fei Peng

Abstract


Maximum-minimum bidirectional options are a kind of exotic path dependent options. In the constant elasticity of variance (CEV) model, a combining trinomial tree was structured to approximate the nonconstant volatility that is a function of the underlying asset. On this basis, a simple and efficient recursive algorithm was developed to compute the risk-neutral probability of each different node for the underlying asset reaching a maximum or minimum price and the total number of maxima (minima) in the trinomial tree. With help of it, the computational problems can be effectively solved arising from the inherent complexities of different types of maximum-minimum bidirectional options when the underlying asset evolves as the trinomial CEV model. Numerical results demonstrate the validity and the convergence of the approach mentioned above for the different parameter values set in the trinomial CEV model.

© 2016 Published by Elsevier España, S.L.U. on behalf of Universidad ESAN. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).


Keywords


Trinomial CEV model; Recursive algorithm; Maximum-minimum bidirectional options

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 The bi-annual academic publication of Universidad ESAN

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

The Universidad ESAN, with more than 50 years of experience in the higher education field and post graduate studies, desires to contribute to the academic community with the most outstanding pieces of research. We gratefully welcome suggestions and contributions from our readers in order to help
us hit our goals.