Title :
Pricing the American put using a new class of tight lower bounds
Author :
Magdon-Ismail, Malik
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
We present new families of lower bounds for the price of the American put option on a dividend paying stock when the stock follows a log normal process and the option can be exercised continuously to a finite horizon T. By put call parity, these bounds can be easily converted to bounds on the price of the American call option on a dividend paying stock. By numerically optimizing these bounds, we obtain tighter bounds on the option price. Our methodology simultaneously furnishes us with an (exponential) exercise strategy. We provide an extensive experimental computation, comparing with convergent binomial tree pricing methods. Our bounds deliver an accuracy comparable to a 2000 step binomial tree, with a computational cost comparable to a 400 step binomial tree.
Keywords :
computational complexity; costing; log normal distribution; optimisation; stock markets; American call option; American put pricing; computational cost; convergent binomial tree pricing methods; experimental computation; finite horizon; log normal process; optimization; put call parity; tight lower bounds; Computational efficiency; Computational modeling; Computer science; Fitting; History; Integral equations; Numerical simulation; Pricing; Upper bound;
Conference_Titel :
Computational Intelligence for Financial Engineering, 2003. Proceedings. 2003 IEEE International Conference on
Print_ISBN :
0-7803-7654-4
DOI :
10.1109/CIFER.2003.1196247