Anastasiia Zalashko | Searcharxiv

arXiv2017

Causal optimal transport and its links to enlargement of filtrations and continuous-time stochastic optimization

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.

math.PR↗

arXiv2017

Causal transport in discrete time and applications

Loosely speaking, causal transport plans are a relaxation of adapted processes in the same sense as Kantorovich transport plans extend Monge-type transport maps. The corresponding causal version of the transport problem has recently been introduced by Lassalle. Working in a discrete time setup, we establish a dynamic programming principle that links the causal transport problem to the transport problem for general costs recently considered by Gozlan et al. Based on this recursive principle, we give conditions under which the celebrated Knothe-Rosenblatt rearrangement can be viewed as a causal analogue to the Brenier's map. Moreover, these considerations provide transport-information inequalities for the nested distance between stochastic processes pioneered by Pflug and Pichler, and so serve to gauge the discrepancy between stochastic programs driven by different noise distributions.

math.OC↗