ترغب بنشر مسار تعليمي؟ اضغط هنا

Marginal and dependence uncertainty: bounds, optimal transport, and sharpness

80   0   0.0 ( 0 )
 نشر من قبل Antonis Papapantoleon
 تاريخ النشر 2017
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Motivated by applications in model-free finance and quantitative risk management, we consider Frechet classes of multivariate distribution functions where additional information on the joint distribution is assumed, while uncertainty in the marginals is also possible. We derive optimal transport duality results for these Frechet classes that extend previous results in the related literature. These proofs are based on representation results for increasing convex functionals and the explicit computation of the conjugates. We show that the dual transport problem admits an explicit solution for the function $f=1_B$, where $B$ is a rectangular subset of $mathbb R^d$, and provide an intuitive geometric interpretation of this result. The improved Frechet--Hoeffding bounds provide ad-hoc upper bounds for these Frechet classes. We show that the improved Frechet--Hoeffding bounds are pointwise sharp for these classes in the presence of uncertainty in the marginals, while a counterexample yields that they are not pointwise sharp in the absence of uncertainty in the marginals, even in dimension 2. The latter result sheds new light on the improved Frechet--Hoeffding bounds, since Tankov [30] has showed that, under certain conditions, these bounds are sharp in dimension 2.



قيم البحث

اقرأ أيضاً

We study the problem of bounding path-dependent expectations (within any finite time horizon $d$) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark marginal d istributions. This problem is a relaxation of the martingale optimal transport (MOT) problem and is motivated by applications to super-hedging in financial markets. We show that the empirical version of our relaxed MOT problem can be approximated within $Oleft( n^{-1/2}right)$ error where $n$ is the number of samples of each of the individual marginal distributions (generated independently) and using a suitably constructed finite-dimensional linear programming problem.
This paper is devoted to obtaining a wellposedness result for multidimensional BSDEs with possibly unbounded random time horizon and driven by a general martingale in a filtration only assumed to satisfy the usual hypotheses, i.e. the filtration may be stochastically discontinuous. We show that for stochastic Lipschitz generators and unbounded, possibly infinite, time horizon, these equations admit a unique solution in appropriately weighted spaces. Our result allows in particular to obtain a wellposedness result for BSDEs driven by discrete--time approximations of general martingales.
133 - Christian Leonard 2007
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle with an op timal transport cost as its rate function. As a consequence, new approximation results for the optimal cost function and the optimal transport plans are derived. They follow from the Gamma-convergence of a sequence of normalized relative entropies toward the optimal transport cost. A wide class of cost functions including the standard power cost functions $|x-y|^p$ enter this framework.
In this article we study and classify optimal martingales in the dual formulation of optimal stopping problems. In this respect we distinguish between weakly optimal and surely optimal martingales. It is shown that the family of weakly optimal and su rely optimal martingales may be quite large. On the other hand it is shown that the Doob-martingale, that is, the martingale part of the Snell envelope, is in a certain sense the most robust surely optimal martingale under random perturbations. This new insight leads to a novel randomized dual martingale minimization algorithm that doesnt require nested simulation. As a main feature, in a possibly large family of optimal martingales the algorithm efficiently selects a martingale that is as close as possible to the Doob martingale. As a result, one obtains the dual upper bound for the optimal stopping problem with low variance.
This paper addresses the joint calibration problem of SPX options and VIX options or futures. We show that the problem can be formulated as a semimartingale optimal transport problem under a finite number of discrete constraints, in the spirit of [ar Xiv:1906.06478]. We introduce a PDE formulation along with its dual counterpart. The solution, a calibrated diffusion process, can be represented via the solutions of Hamilton-Jacobi-Bellman equations arising from the dual formulation. The method is tested on both simulated data and market data. Numerical examples show that the model can be accurately calibrated to SPX options, VIX options and VIX futures simultaneously.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا