Pricing American options
Subtitle: a duality approach
By: Leonid Kogan [and] Martin Haugh.
Contributors: Haugh, Martin B. 1971-; Sloan School of Management.
Series: Working paper -- 4340-01; Working paper (Sloan School of Management) -- 4340.
Publisher: Alfred P. Sloan School of Management, Massachusetts Institute of Technology]
Published: 2001
Place of publication: [Cambridge, Mass
Language: eng
Number of pages: 38
Other titles: Pricing high-dimensional American options.
Description: We develop a new method for pricing American options. The main practical contribution of this paper is a general algorithm for constructing upper and lower bounds on the true price of the option using any approximation to the option price. We show that our bounds are tight, so that if the initial approximation is close to the true price of the option, the bounds are also guaranteed to be close. We also explicitly characterize the worst-case performance of the pricing bounds. The computation of the lower bound is straightforward and relies on simulating the suboptimal exercise strategy implied by the approximate option price. The upper bound is also computed using Monte Carlo simulation. This is made feasible by the representation of the American option price as a solution of a properly defined dual minimization problem, which is the main theoretical result of this paper. Our algorithm proves to be accurate on a set of sample problems where we price call options on the maximum and the geometric mean of a collection of stocks. These numerical results suggest that our pricing method can be successfully applied to problems of practical interest. Keywords: Asset pricing, dynamic programming, simulation, American option, optimal stopping, duality.