A New Howard–Crandall–Douglas Algorithm for the American Option Problem in Computational Finance

2018 ◽  
pp. 135-143 ◽  
Author(s):  
Nawdha Thakoor ◽  
Dhiren Kumar Behera ◽  
Désiré Yannick Tangman ◽  
Muddun Bhuruth
Keyword(s):  
American Option ◽  
Computational Finance

New Bounds on American Option Prices

2007 ◽  
Author(s):  
In Joon Kim ◽  
Geun Hyuk Chang ◽  
Suk-Joon Byun
Keyword(s):  
American Option ◽  
Option Prices

scholarly journals Randomized Binomial Tree and Pricing of American-Style Options

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Hu Xiaoping ◽  
Cao Jie
Keyword(s):  
American Option ◽  
Option Prices ◽  
Occurrence Probability ◽  
Binomial Tree ◽  
No Arbitrage ◽  
Complete Market ◽  
Cubic Polynomial ◽  
American Style ◽  
The Impact ◽  
And Storage

Randomized binomial tree and methods for pricing American options were studied. Firstly, both the completeness and the no-arbitrage conditions in the randomized binomial tree market were proved. Secondly, the description of the node was given, and the cubic polynomial relationship between the number of nodes and the time steps was also obtained. Then, the characteristics of paths and storage structure of the randomized binomial tree were depicted. Then, the procedure and method for pricing American-style options were given in a random binomial tree market. Finally, a numerical example pricing the American option was illustrated, and the sensitivity analysis of parameter was carried out. The results show that the impact of the occurrence probability of the random binomial tree environment on American option prices is very significant. With the traditional complete market characteristics of random binary and a stronger ability to describe, at the same time, maintaining a computational feasibility, randomized binomial tree is a kind of promising method for pricing financial derivatives.

Sign in / Sign up

Export Citation Format

Share Document