2013
DOI: 10.1007/978-3-642-41095-6_9
|View full text |Cite
|
Sign up to set email alerts
|

Conditional Sampling for Barrier Option Pricing Under the Heston Model

Abstract: We propose a quasi-Monte Carlo algorithm for pricing knock-out and knock-in barrier options under the Heston (1993) stochastic volatility model. This is done by modifying the LT method from Imai and Tan (2006) for the Heston model such that the first uniform variable does not influence the stochastic volatility path and then conditionally modifying its marginals to fulfill the barrier condition(s). We show that this method is unbiased and never does worse than the unconditional algorithm. In addition, the cond… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 18 publications
(23 citation statements)
references
References 14 publications
0
23
0
Order By: Relevance
“…One may write that W 1 (t) =ρB 1 (t) + ρB 2 (t) and W 2 (t) = B 2 (t), whereρ = 1 − ρ 2 , B 1 (t) and B 2 (t) are two independent standard Brownian motions. We use the Euler-Maruyama scheme to discretize the asset paths in log-space (Achtsis et al, 2013b), resulting in…”
Section: Extension To Heston Modelmentioning
confidence: 99%
“…One may write that W 1 (t) =ρB 1 (t) + ρB 2 (t) and W 2 (t) = B 2 (t), whereρ = 1 − ρ 2 , B 1 (t) and B 2 (t) are two independent standard Brownian motions. We use the Euler-Maruyama scheme to discretize the asset paths in log-space (Achtsis et al, 2013b), resulting in…”
Section: Extension To Heston Modelmentioning
confidence: 99%
“…We pair the weighted Sobolev space with randomly shifted lattice rules; the complete theory can be found in [13]. Randomly shifted lattice rules approximate the integral (1) by…”
Section: Randomly Shifted Lattice Rulesmentioning
confidence: 99%
“…An interlaced polynomial lattice rule with interlacing factor α ≥ 2, with irreducible modulus polynomial of degree m, and with n = 2 m points in s dimensions, can be constructed by a CBC algorithm such that, for all λ ∈ (1/α, 1],…”
Section: Setting 3: Smooth Integrands In the Unit Cubementioning
confidence: 99%
See 1 more Smart Citation
“…As conditional expectations always reduce the variance of a random variable, this trick can also be useful in a Monte Carlo setting as well. In this sense, the method is similar to the one proposed in [1,2], who also reduce the variance of a (Q)MC estimator of a barrier option prices by clever transformation of the integrand coupled with identification of the region of positive payoff values in terms of the integration variables. The approach presented here is different since we really focus on the smoothing aspect (obtaining lower variance as a welcome by-product), whereas the previous approach is really focused on the variance, obtaining a smoother integrand as a by-product.…”
Section: Introductionmentioning
confidence: 99%