We consider the problem of finding consistent upper price bounds and super replication strategies for exotic options, given the observation of call prices in the market. This field of research is called model-independent finance and has been introduced by Hobson 1998. Here we use the link to mass transport problems. In contrast to existing literature we assume that the marginal distributions at the two time points we consider are discrete probability distributions. This has the advantage that the optimization problems reduce to linear programs and can be solved rather easily when assuming a general martingale Spence Mirrlees condition. We will prove the optimality of left-monotone transport plans under this assumption and provide an algorithm for its construction. Our proofs are simple and do not require much knowledge of probability theory. At the end we present an example to illustrate our approach.
We describe an abstract control-theoretic framework in which the validity of the dynamic programming principle can be established in continuous time by a verification of a small number of structural properties. As an application we treat several cases of interest, most notably the lower-hedging and utility-maximization problems of financial mathematics both of which are naturally posed over ``sets of martingale measures''.
We construct an abstract framework in which the dynamic programming principle (DPP) can be readily proven. It encompasses a broad range of common stochastic control problems in the weak formulation, and deals with problems in the "martingale formulation" with particular ease. We give two illustrations; first, we establish the DPP for general controlled diffusions and show that their value functions are viscosity solutions of the associated Hamilton-Jacobi-Bellman equations under minimal conditions. After that, we show how to treat singular control on the example of the classical monotone-follo…
We propose two deep neural network-based methods for solving semi-martingale optimal transport problems. The first method is based on a relaxation/penalization of the terminal constraint, and is solved using deep neural networks. The second method is based on the dual formulation of the problem, which we express as a saddle point problem, and is solved using adversarial networks. Both methods are mesh-free and therefore mitigate the curse of dimensionality. We test the performance and accuracy of our methods on several examples up to dimension 10. We also apply the first algorithm to a portfol…
In this paper, we introduce a primal-dual algorithm for solving (martingale) optimal transportation problems, with cost functions satisfying the twist condition, close to the one that has been used recently for training generative adversarial networks. As some additional applications, we consider anomaly detection and automatic generation of financial data.
Stability of the value function and the set of minimizers w.r.t. the given data is a desirable feature of optimal transport problems. For the classical Kantorovich transport problem, stability is satisfied under mild assumptions and in general frameworks such as the one of Polish spaces. However, for the martingale transport problem several works based on different strategies established stability results for R only. We show that the restriction to dimension d = 1 is not accidental by presenting a sequence of marginal distributions on R 2 for which the martingale optimal transport problem is n…
The dual representation of the martingale optimal transport problem in the Skorokhod space of multi dimensional cadlag processes is proved. The dual is a minimization problem with constraints involving stochastic integrals and is similar to the Kantorovich dual of the standard optimal transport problem. The constraints are required to hold for very path in the Skorokhod space. This problem has the financial interpretation as the robust hedging of path dependent European options. In this second version, we included the multi-marginal case.
The martingale optimal transport aims to optimally transfer a probability measure to another along the class of martingales. This problem is mainly motivated by the robust superhedging of exotic derivatives in financial mathematics, which turns out to be the corresponding Kantorovich dual. In this paper we consider the continuous-time martingale transport on the Skorokhod space of cadlag paths. Similar to the classical setting of optimal transport, we introduce different dual problems and establish the corresponding dualities by a crucial use of the S-topology and the dynamic programming princ…
We determine the optimal structure of couplings for the \emph{Martingale transport problem} between radially symmetric initial and terminal laws $μ, ν$ on $\R^d$ and show the uniqueness of optimizer. Here optimality means that such solutions will minimize the functional $\E |X-Y|^p$ where $0<p \leq 1$, and the dimension $d$ is arbitrary.
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisation of the marginal distributions combined with a suitable relaxation of the martingale constraint. Specialising to dimension one, we provide bounds on the convergence rate of the above scheme. We also show a stability result under only partial specification of the marginal dist…
We introduce a Benamou-Brenier formulation for the continuous-time martingale optimal transport problem as a weak length relaxation of its discrete-time counterpart. By the correspondence between classical martingale problems and Fokker-Planck equations, we obtain an equivalent PDE formulation for which basic properties such as existence, duality and geodesic equations can be analytically studied, yielding corresponding results for the stochastic formulation. In the one dimensional case, sufficient conditions for finiteness of the cost are also given and a link between geodesics and porous med…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality theory for general marginals and measurable reward (cost) functions: absence of a duality gap and existence of dual optimizers. Both properties are shown to fail in the classical formulation. As a consequence of the duality result, we obtain a general principle of cyclical monotonicity describing the geometry of optimal transports.
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the theory of set-valued maps. In particular, using results from Beiglböck, Jourdain, Margheriti, and Pammer [5], we show that the set of martingale measures with fixed marginals is continuous, i.e., lower- and upper hemicontinuous, w.r.t. its marginals. Moreover, we establish compactness of the set of optimizers as well as upper hemicontinuity of the optimizers w…
We study a variant of the martingale optimal transport problem in a multi-period setting to derive robust price bounds of a financial derivative. On top of marginal and martingale constraints, we introduce a time-homogeneity assumption, which restricts the variability of the forward-looking transitions of the martingale across time. We provide a dual formulation in terms of superhedging and discuss relaxations of the time-homogeneity assumption by adding market frictions. In financial terms, the introduced time-homogeneity corresponds to a time-consistency condition for call prices, given the …
Stanford University（斯坦福大学）；Chinese University of Hong Kong（香港中文大学）
Distributionally robust optimization has been shown to offer a principled way to regularize learning models. In this paper, we find that Tikhonov regularization is distributionally robust in an optimal transport sense (i.e., if an adversary chooses distributions in a suitable optimal transport neighborhood of the empirical measure), provided that suitable martingale constraints are also imposed. Further, we introduce a relaxation of the martingale constraints which not only provides a unified viewpoint to a class of existing robust methods but also leads to new regularization tools. To realize…
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 distributions. 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 $O\left( n^{-1/2}\right)$ error where $n$ is the number of samples of each of the individual mar…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are fixed. Inspired by recent applications in mathematical finance and connections with the peacock problem, we study this problem under the additional condition that $(X_i)_{i=1,2}$ is a martingale, that is, $\mathbb {E}[X_2|X_1]=X_1$. We establish a variational principle for this problem which enables us to determine optimal martingale transport plans for specific …
We present a new, tractable method for solving and analyzing risk-aware control problems over finite and infinite, discounted time-horizons where the dynamics of the controlled process are described as a martingale problem. Supposing general Polish state and action spaces, and using generalized, relaxed controls, we state a risk-aware dynamic optimal control problem of minimizing risk of costs described by a generic risk function. We then construct an alternative formulation that takes the form of a nonlinear programming problem, constrained by the dynamic, {i.e.} time-dependent, and linear Ko…
Consider a multiperiod optimal transport problem where distributions $μ_{0},\dots,μ_{n}$ are prescribed and a transport corresponds to a scalar martingale $X$ with marginals $X_{t}\simμ_{t}$. We introduce particular couplings called left-monotone transports; they are characterized equivalently by a no-crossing property of their support, as simultaneous optimizers for a class of bivariate transport cost functions with a Spence--Mirrlees property, and by an order-theoretic minimality property. Left-monotone transports are unique if $μ_{0}$ is atomless, but not in general. In the one-period case …
We consider an optimal stopping problem where a constraint is placed on the distribution of the stopping time. Reformulating the problem in terms of so-called measure-valued martingales allows us to transform the marginal constraint into an initial condition and view the problem as a stochastic control problem; we establish the corresponding dynamic programming principle.
We develop the linear programming approach to mean-field games in a general setting. This relaxed control approach allows to prove existence results under weak assumptions, and lends itself well to numerical implementation. We consider mean-field game problems where the representative agent chooses both the optimal control and the optimal time to exit the game, where the instantaneous reward function and the coefficients of the state process may depend on the distribution of the other agents. Furthermore, we establish the equivalence between mean-field games equilibria obtained by the linear p…
We develop a non-anticipating calculus of variations for functionals on a space of laws of continuous semi-martingales, which extends the classical one. We extend Hamilton's least action principle and Noether's theorem to this generalized stochastic framework. As an application we obtain, under mild conditions, a stochastic Euler-Lagrange condition and invariants for the critical points of recent problems in stochastic control, namely for the semi-martingale optimal transportation problems.
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex transport constraints in addition to having given initial and terminal marginals. Several applications are provided: martingale measures with volatility uncertainty, optimal transport with capacity constraints, and Skorokhod embedding with bounded times. Next, we extend this result to multi-marginal constraints. Finally, we consider an optimal transport problem w…
This paper studies a discrete-time optimal switching problem on a finite horizon. The underlying model has a running reward, terminal reward and signed (positive and negative) switching costs. Using the martingale approach to optimal stopping problems, we extend a well known explicit dynamic programming method for computing the value function and the optimal strategy to the case of signed switching costs.
This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function. We present numerical examples from optimal transport, martingale optimal transport, portfolio optimization under uncertainty and generative adversarial networks that showcase the generality and effectiveness of the approach.
We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex cone of functions. This allows us to provide novel proofs of duality formulae. Among our tools is Strassen's theorem. We provide new formulations of the primal and the dual problem for martingale optimal transport employing a novel representation of the set of extreme points of probability measures in convex order on Euclidean space. We exhibit a link to un…
A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality theorem for capacity-constrained optimal transport as an infinite-dimensional application.
We provide a compactness criterion for the set of laws $\mathfrak{P}^{ac}_{sem}(Θ)$ on the Skorokhod space for which the canonical process $X$ is a semimartingale having absolutely continuous characteristics with differential characteristics taking values in some given set $Θ$ of Lévy triplets. Whereas boundedness of $Θ$ implies tightness of $\mathfrak{P}^{ac}_{sem}(Θ)$, closedness fails in general, even when choosing $Θ$ to be additionally closed and convex, as a sequence of purely discontinuous martingales may converge to a diffusion. To that end, we provide a necessary and sufficient condit…
In this paper, an uncertain Multi-objective Multi-item Solid Transportation Problem (MMSTP) based on uncertainty theory is presented. In the model, transportation costs, supplies, demands and conveyances parameters are taken to be uncertain parameters. There are restrictions on some items and conveyances of the model. Therefore, some particular items cannot be transported by some exceptional conveyances. Using the advantage of uncertainty theory, the MMSTP is first converted into an equivalent deterministic MMSTP. By applying convex combination method and minimizing distance function method, t…
We consider the optimal Skorokhod embedding problem (SEP) given full marginals over the time interval $[0,1]$. The problem is related to the study of extremal martingales associated with a peacock ("process increasing in convex order", by Hirsch, Profeta, Roynette and Yor). A general duality result is obtained by convergence techniques. We then study the case where the reward function depends on the maximum of the embedding process, which is the limit of the martingale transport problem studied in Henry-Labordere, Obloj, Spoida and Touzi. Under technical conditions, some explicit characteristi…
Bridging Schrödinger and Bass: A Semimartingale Optimal Transport Problem with Diffusion Control
QubeRT；BNPP and Monash University（法国巴黎银行和蒙纳士大学）；LPSM, Sorbonne Université and Université Paris Cité（LPSM、索邦大学和巴黎西岱大学）；Ecole Polytechnique, CMAP（巴黎综合理工学院，CMAP）；NYU Tandon School of Engineering（纽约大学坦登工程学院）
