Convex Order and Arbitrage

Abstract

Wiesel and Zhang [2023] established that two probability measures μ, on Rd with finite second moments are in convex order (i.e. μ c ) if and only if W2(,)2-W2(μ,)2 ≤ ∫ |y|2(dy) - ∫ |x|2μ(dx). Let us call a measure maximizing W2(,)2-W2(μ,)2 the optimal . This paper summarizes key findings by Wiesel and Zhang, develops new algorithms enhancing the search of optimal , and builds on the paper through constructing a model-independent arbitrage strategy and developing associated numerical methods via the convex function recovered from the optimal through Brenier's theorem. In addition to examining the link between convex order and arbitrage through the lens of optimal transport, the paper also gives a brief survey of functionally generated portfolio in stochastic portfolio theory and offers a conjecture of the link between convex order and arbitrage between two functionally generated portfolios.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…