Abstract
Tree pricing schemes are natural in finance because of their Markov chain interpretation as discrete time pricing models. From a practical point of view, trees are often rather obsolete as compared with more sophisticated finite difference or finite element technologies. However, in a number of situations, they remain an adequate and simple alternative. Moreover, from the theoretical point of view, the Markov chain interpretation underlies interesting probabilistic convergence proofs of the related (deterministic) pricing schemes.
Note that there is no hermetic frontier between deterministic and stochastic pricing schemes. In essence, all these numerical schemes are based on the idea of propagating the solution, starting from a surface of the time-space domain on which it is known (the maturity of the derivative), along suitable (random) “characteristics” of the problem (here “characteristics” refers to Riemann’s method for solving hyperbolic first-order equations). From the point of view of control theory, all these numerical schemes can be viewed as variants of Bellman’s dynamic programming principle. Monte Carlo pricing schemes may thus be regarded as one-time-step multinomial trees, converging to a limiting jump diffusion when the number of space discretization points (tree branches) goes to infinity. The difference between a tree method in the usual sense and a Monte Carlo method is that a Monte Carlo computation mesh is stochastically generated and nonrecombining.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Unless \(\frac{\phi(\mathrm{u}S_{0})}{\phi(\mathrm{d}S_{0})}=\frac{\mathrm{u}-1}{\mathrm{d}-1}\), in which case the system admits an infinity of solutions.
- 2.
With e κh∈[d,u], in order to obtain that \(p=\frac{e^{\kappa {\mathrm{h}}}-\mathrm{d}}{\mathrm{u}-\mathrm{d}}\in[0,1]\); otherwise p only defines a signed probability measure.
- 3.
See Sect. 4.3 of Kushner and Dupuis [170].
- 4.
See Sect. 4.3 of Kushner and Dupuis [170].
References
Cox, J., Ross, S., & Rubinstein, M. (1979). Option pricing: a simplified approach. Journal of Financial Economics, 7(3), 229–263.
Ethier, H., & Kurtz, T. (1986). Markov processes. Characterization and convergence. New York: Wiley-Interscience.
Jacod, J., & Shiryaev, A. (2003). Limit theorems for stochastic processes. Berlin: Springer.
Kamrad, B., & Ritchken, P. (1991). Multinomial approximating models for options with k state variables. Management Science, 37, 1640–1652.
Kushner, H. (1977). Probability methods for approximations in stochastic control and for elliptic equations. San Diego: Academic Press.
Kushner, H., & Dupuis, B. (1992). Numerical methods for stochastic control problems in continuous time. Berlin: Springer.
Ritchken, P. (1995). On pricing barrier options. The Journal of Derivatives, 3(2), 19–28.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Crépey, S. (2013). Tree Methods. In: Financial Modeling. Springer Finance(). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37113-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-37113-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37112-7
Online ISBN: 978-3-642-37113-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)