2013
DOI: 10.1137/110855909
|View full text |Cite
|
Sign up to set email alerts
|

Conditional Sampling for Barrier Option Pricing under the LT Method

Abstract: We develop a conditional sampling scheme for pricing knock-out barrier options under the Linear Transformations (LT) algorithm from Imai and Tan (2006), ref. [14]. We compare our new method to an existing conditional Monte Carlo scheme from Glasserman and Staum (2001), ref. [11], and show that a substantial variance reduction is achieved. We extend the method to allow pricing knock-in barrier options and introduce a root-finding method to obtain a further variance reduction. The effectiveness of the new method… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(25 citation statements)
references
References 21 publications
0
25
0
Order By: Relevance
“…Note that we have A 1 > 0 for 1 ≤ ≤ d because the elements of the eigenvector u 1 are all positive. For approximate integration with quadrature, we generate randomized QMC or MC samples x (1) , . .…”
Section: Numerical Experiments: Application To Option Pricingmentioning
confidence: 99%
“…Note that we have A 1 > 0 for 1 ≤ ≤ d because the elements of the eigenvector u 1 are all positive. For approximate integration with quadrature, we generate randomized QMC or MC samples x (1) , . .…”
Section: Numerical Experiments: Application To Option Pricingmentioning
confidence: 99%
“…So we refer to this the variable push-out (VPO) smoothing method, and callμ sm the smoothed estimate. Achtsis et al (2013a) used a similar idea to price barrier options under the LT method. Their motivation was to make the sampling scheme compatible with the LT method.…”
Section: The Variable Push-out Methodsmentioning
confidence: 99%
“…The function f (Z Z Z) is then sampled using the transformation Z Z Z = Qz z z for a carefully chosen orthogonal matrix Q. This means that in (1) and (2) we take, for k = 0, . .…”
Section: The Lt Methods For Heston Under Log Pricesmentioning
confidence: 99%
“…In previous work [1] we have introduced a conditional sampling method to deal with barrier conditions in the Black-Scholes setting that can be used in combination with a good path construction method like the LT method. In that paper we have shown that such a scheme always performs better than the unconditional method.…”
Section: Introductionmentioning
confidence: 99%