Learn More
We present simple and fast algorithms for computing very tight upper and lower bounds on the prices of American Asian options in the binomial model. We introduce a new refined version of the Cox-Ross-Rubinstein [4] binomial lattice of stock prices. Each node in the lattice is partitioned into " nodelets " , each of which represents all paths arriving at the(More)
  • 1