Information-Based Martingale Optimal Transport

Randomized arcade processes are a class of continuous stochastic processes that interpolate in a strong sense, i.e., omega by omega, between any given ordered set of random variables, at fixed pre-specified times. Utilizing these processes as generators of partial information, a class of continuous-time martingale -- the filtered arcade martingales (FAMs) -- is constructed. FAMs interpolate through a sequence of target random variables, which form a discrete-time martingale. The research presented in this paper treats the problem of selecting the worst martingale coupling for given, convexly ordered, probability measures contingent on the paths of FAMs that are constructed using the martingale coupling. This optimization problem, that we term the information-based martingale optimal transport problem (IB-MOT), can be viewed from different perspectives. It can be understood as a model-free construction of FAMs, in the case where the coupling is not determined, a priori. It can also be considered from the vantage point of optimal transport (OT), where the problem is concerned with introducing a noise factor in martingale optimal transport, similarly to how the entropic regularization of optimal transport introduces noise in OT. The IB-MOT problem is static in its nature, since it is concerned with finding a coupling, but a corresponding dynamical solution can be found by considering the FAM constructed with the identified optimal coupling. Existence and uniqueness of its solution are shown, and an algorithm for empirical measures is proposed.
Comment: 19 pages. arXiv admin note: substantial text overlap with arXiv:2301.05936