2019
DOI: 10.1142/s021902491950002x
|View full text |Cite
|
Sign up to set email alerts
|

Sampling of One-Dimensional Probability Measures in the Convex Order and Computation of Robust Option Price Bounds

Abstract: For [Formula: see text] and [Formula: see text] two probability measures on the real line such that [Formula: see text] is smaller than [Formula: see text] in the convex order, this property is in general not preserved at the level of the empirical measures [Formula: see text] and [Formula: see text], where [Formula: see text] (resp., [Formula: see text]) are independent and identically distributed according to [Formula: see text] (resp., [Formula: see text]). We investigate modifications of [Formula: see text… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
38
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 38 publications
(38 citation statements)
references
References 15 publications
0
38
0
Order By: Relevance
“…Acciaio et al [1] consider an object related to the adapted Wasserstein distance in continuous time in connection with utility maximisation, enlargement of filtrations and optimal stopping. Glanzer et al [26] prove a deviation inequality for the so-called nested distance in a discretetime framework, 3 and consider acceptability pricing over an ambiguity set described through the nested distance. Bion-Nadal and Talay [18] study via PDE arguments a continuous-time optimisation problem which is related to the adapted Wasserstein distance.…”
Section: Literaturementioning
confidence: 99%
See 2 more Smart Citations
“…Acciaio et al [1] consider an object related to the adapted Wasserstein distance in continuous time in connection with utility maximisation, enlargement of filtrations and optimal stopping. Glanzer et al [26] prove a deviation inequality for the so-called nested distance in a discretetime framework, 3 and consider acceptability pricing over an ambiguity set described through the nested distance. Bion-Nadal and Talay [18] study via PDE arguments a continuous-time optimisation problem which is related to the adapted Wasserstein distance.…”
Section: Literaturementioning
confidence: 99%
“…We fix ε > 0 and assume π is bi-causal ε-optimal for AW p (P, Q) andπ is bi-causal ε-optimal for AW p (Q, R). In the next couple of lines, ω always denotes the first coordinate of a vector in 3 , η the second and γ the last. Let…”
Section: Proof Of Lemma 32 It Is Clear Thatmentioning
confidence: 99%
See 1 more Smart Citation
“…Since its introduction in Beiglböck et al (2013), this MOT problem has received recently a great attention in the financial mathematics literature. In particular, the structure of martingale optimal transport couplings has been investigated by Beiglböck and Juillet (2016); Campi et al (2017); De March and Touzi (2019); Ghoussoub et al (2019); Henry-Labordère and Touzi (2016), continuous time formulations by Dolinsky and Soner (2014); Galichon et al (2014); , links with the Skorokhod embedding problem by Beiglböck et al (2017), numerical methods by Alfonsi et al (2020Alfonsi et al ( , 2019; De March (2018); Guo et al (2019); Henry-Labordère (2019) and stability properties by Backhoff-Veraguas and Pammer (2019); Jourdain and Margheriti (2020); Wiesel (2012). The MOT problem is a particular instance where the measurable cost function C : R d × P 1 (R d ) → R is linear in the measure component (C(x, η) = R d c(x, y)η(dy)) of the Weak Martingale Optimal Transport problem inf π∈M(µ,ν) R d C(x, π x )µ(dx).…”
Section: Introductionmentioning
confidence: 99%
“…In two recent papers, Alfonsi et al (2019Alfonsi et al ( , 2020 propose to restore for (µ, ν) ∈ P ≤ × P 1 (R d ) the convex ordering from any finitely supported approximations μ and ν of µ and ν. In dimension d = 1, one may define the increasing (resp.…”
Section: Introductionmentioning
confidence: 99%