Denis Belomestny (Univ. Essen, Allemagne)

In this talk we discuss the complexity of various approximation algorithms for pricing discrete time American options. It turns out that this complexity can be rather high and depends on the so called margin conditions describing the behaviour of the price process near the exercise boundary. We propose a novel multilevel approach to reduce the computational complexity of the pricing algorithms and analyse its performance.