A MEMORY REDUCTION METHOD IN PRICING AMERICAN OPTIONS

摘要

This paper is concerned with the pricing of American options by simulation methods. In the traditional methods, in order to determine when to exercise, we have to store the simulated asset prices at all time steps on all paths. If N time steps and M paths are used, then the storage requirement is O(MN). In this paper, we present a simulation method for pricing American options where the number of storage required only grows like O(M). The only additional computational cost is that we have to generate each random number twice instead of once. For machines with limited memory, we can now use a larger N to improve the accuracy in pricing the options.