Gaussian Importance Sampling and Stratification: Computational Issues


    This paper deals with efficient algorithms for simulating performance measures of Gaussian
    random vectors. Recently, we developed a simulation algorithm which consists of doing
    importance sampling by shifting the mean of the Gaussian random vector. Further variance
    reduction is obtained by stratification along a key direction. A central ingredient of this method is
    to compute the optimal shift of the mean for the importance sampling. The optimal shift is also a
    convenient, and in many cases, an effective direction for the stratification. In this paper, after
    giving a brief overview of the basic simulation algorithms, we focus on issues regarding the
    computation of the optimal change of measure. A primary application of this methodology occurs
    in computational finance for pricing path dependent options.

By: Paul Glasserman, Philip Heidelberger, Perwez Shahabuddin

Published in: RC21291 in 1998

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

RC21291.pdf


Questions about this service can be mailed to reports@us.ibm.com .