论文部分内容阅读
This paper presents simple and fast algorithms for computing very tight upper and lower bounds on the prices of American Asian options in the binomial model.The authors choose two types sets of the actual arithmetic average prices,instead of the simulated values in other existing models,as the representative average prices at each node of the binomial tree.This approach simplifies effectively the computation and reduces the error caused by the linear interpolation.Numerical results show that the approach produces accurate upper and lower bounds compared to the other existing methods based on the binomial tree.
This paper presents simple and fast algorithms for computing very tight upper and lower bounds on the prices of American Asian options in the binomial model. Authors choose two types sets of the actual arithmetic average prices, instead of the simulated values in other existing models, as the representative average prices at each node of the binomial tree. This approach simplifies effectively the computation and reduces the error caused by the linear interpolation. Numerical results show that the approach produces accurate upper and lower bounds compared to the other existing methods based on the binomial tree.