Pricing maximum-minimum bidirectional options in trinomial CEV model

• Autores: Peng, Bin, Peng, Fei
• Formato: artículo
• Fecha de Publicación: 2016
• Institución: Universidad ESAN
• Repositorio: ESAN-Institucional
• Lenguaje: inglés
• OAI Identifier: oai:repositorio.esan.edu.pe:20.500.12640/1980
• Enlace del recurso: https://revistas.esan.edu.pe/index.php/jefas/article/view/137; https://hdl.handle.net/20.500.12640/1980; https://doi.org/10.1016/j.jefas.2016.06.001
• Nivel de acceso: acceso abierto
• Materia: Trinomial CEV model; Recursive algorithm; Maximum-minimum bidirectional options; Modelo ECV trinomial; Algoritmo recursivo; Opciones bidireccionales máximas-mínimas; https://purl.org/pe-repo/ocde/ford#5.02.04

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.