We study Mean Field stochastic control problems where the cost function and the state dynamics depend upon the joint distribution of the controlled state and the control process. We prove suitable versions of the Pontryagin stochastic maximum principle, both in necessary and in sufficient form, which extend the known conditions to this general framework. Furthermore, we suggest a variational approach to study a weak formulation of these control problems. We show a natural connection between this weak formulation and optimal transport on path space, which inspires a novel discretization scheme.
The optimal weak transport problem has recently been introduced by Gozlan et. al. [25]. We provide general existence and duality results for these problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity. As an application we extend the Brenier-Strassen Theorem of Gozlan-Juillet [23] to general probability measures on R d under minimal assumptions.A driving idea behind our proofs is to consider the set of transport plans with a new ('adapted') topology which seems better suited for the weak transport problem and allows to carry out arguments which are close to the proofs in the classical setup.
The martingale part in the semimartingale decomposition of a Brownian motion with respect to an enlargement of its filtration, is an anticipative mapping of the given Brownian motion. In analogy to optimal transport theory, we define causal transport plans in the context of enlargement of filtrations, as the Kantorovich counterparts of the aforementioned non-adapted mappings. We provide a necessary and sufficient condition for a Brownian motion to remain a semimartingale in an enlarged filtration, in terms of certain minimization problems over sets of causal transport plans. The latter are also used in order to give robust transport-based estimates for the value of having additional information, as well as model sensitivity with respect to the reference measure, for the classical stochastic optimization problems of utility maximization and optimal stopping. Our results have natural extensions to the case of general multidimensional continuous semimartingales.
A. In classical optimal transport, the contributions of Benamou-Brenier and Mc-Cann regarding the time-dependent version of the problem are cornerstones of the field and form the basis for a variety of applications in other mathematical areas.Stretched Brownian motion provides an analogue for the martingale version of this problem. In this article we provide a characterization in terms of gradients of convex functions, similar to the characterization of optimizers in the classical transport problem for quadratic distance cost.
Assume that an agent models a financial asset through a measure Q with the goal to price/hedge some derivative or optimise some expected utility. Even if the model Q is chosen in the most skilful and sophisticated way, the agent is left with the possibility that Q does not provide an exact description of reality. This leads us to the following question: will the hedge still be somewhat meaningful for models in the proximity of Q? If we measure proximity with the usual Wasserstein distance (say), the answer is No. Models which are similar with respect to the Wasserstein distance may provide dramatically different information on which to base a hedging strategy. Remarkably, this can be overcome by considering a suitable adapted version of the Wasserstein distance which takes the temporal structure of pricing models into account. This adapted Wasserstein distance is most closely related to the nested distance as pioneered by Pflug and Pichler (
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.