Pricing Variance, Gamma, and Corridor Swaps Using Multinomial Trees

Pricing and hedging real world derivatives requires approximation methods for all but the plainest of plain vanilla cases. The two standard classes of valuation tools are lattices (trees) and Monte Carlo simulation. Lattice methods start at maturity and work backward through the tree to compute the...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of derivatives 2017-12, Vol.25 (2), p.7-21
Main Authors: Zhao, Honglei, Zhao, Zhe, Chatterjee, Rupak, Lonon, Thomas, Florescu, Ionuţ
Format: Article
Language:English
Subjects:
Approximation
Derivatives
Expected values
Fair value
Hedging
Methods
Monte Carlo simulation
Price variance
Prices
Pricing policies
Stochastic models
Swap arrangements
Volatility
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Pricing and hedging real world derivatives requires approximation methods for all but the plainest of plain vanilla cases. The two standard classes of valuation tools are lattices (trees) and Monte Carlo simulation. Lattice methods start at maturity and work backward through the tree to compute the derivative value at the beginning. This works very well as long as the payoff at a given time step depends on the asset price at that date but not on the path the price followed to arrive there. There are many more paths through a tree than there are time steps, so path-dependent problems normally require Monte Carlo and calculations over a very large number of paths to achieve accuracy. This raises major problems for valuing derivatives based on volatility and other higher moments of the returns distribution, because realized values of these statistics do depend on the path and not just the terminal price. In this article, the authors present a new kind of lattice procedure for variance swaps and related contracts that achieves the accuracy of a Monte Carlo approximation in execution time that is very much less--more than two orders of magnitude faster in a basic example. The technique involves a single backward pass through the tree, with efficient calculations of conditional future variance through expiration at each intermediate node being built up along the way. The procedure does not depend on any specific returns process, and examples with several well-known stochastic volatility models show excellent performance on all of them.
ISSN:1074-1240
2168-8524
DOI:10.3905/jod.2017.25.2.007