An iterated Azéma-Yor type embedding for finitely many marginals (Q2406561): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q590139 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Yuliya S. Mishura / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1304.0368 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2962765839 / rank | |||
Normal rank |
Latest revision as of 09:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An iterated Azéma-Yor type embedding for finitely many marginals |
scientific article |
Statements
An iterated Azéma-Yor type embedding for finitely many marginals (English)
0 references
5 October 2017
0 references
The authors consider an \(n\)-marginal Skorokhod embedding problem and construct an explicit solution with desirable optimal properties. To describe the problem, consider a standard Brownian motion \(B\) and a sequence of probability measures \(\mu_1,\dots,\mu_n\). A solution is a sequence of stopping times \(\tau_1\leq \cdots\leq \tau_n \) such that \(B_{\tau_i}\sim \mu_i\), \(1\leq i\leq n\), and \(B_{t\wedge \tau_n}\), \(t\geq 0\), is a uniformly integrable martingale. A solution may exist only if all \(\mu_i\) are centered and their sequence is in convex order. The problem is solved under additional technical assumptions. The nuances of the solution of the problem and its complexity in comparison with the case \(n=1\) are clearly explained. Applications to robust pricing and hedging of lookback options are discussed.
0 references
Skorokhod embedding problem
0 references
Azéma-Yor embedding
0 references
maximum process
0 references
martingale optimal transport
0 references
continuous martingale
0 references
marginal constraints
0 references