Paper: arXiv 2510.03332
Authors: Gabriela Kováčová, Georg Menz, Niket Patel
Abstract
Motivated by optimal re-balancing of a portfolio, we formalize an optimal transport problem in which the transported mass is scaled by a mass-change factor depending on the source and destination. This allows direct modeling of the creation or destruction of mass. We discuss applications and position the framework alongside unbalanced, entropic, and unnormalized optimal transport. The existence of optimal transport plans and strong duality are established. The existence of optimal maps are deduced in two central regimes, i.e., perturbative mass-change and quadratic mass-loss. For \(\ell_p\) costs we derive the analogue of the Benamou-Brenier dynamic formulation.
Complexity vs Empirical Score
- Math Complexity: 9.0/10
- Empirical Rigor: 1.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper introduces a novel mathematical framework for non-conservative optimal transport with advanced proofs and derivations (e.g., strong duality, existence of optimal maps, Benamou-Brenier analogue), but provides only a conceptual financial motivation without any backtesting, datasets, or implementation details.
Research Flowchart
flowchart TD A["Research Goal<br>Formulate an optimal transport problem<br>modeling mass creation/destruction"] --> B["Methodology<br>Formalize framework with<br>mass-change factor μ(x,y)"] B --> C["Inputs<br>Portfolio rebalancing context<br>Unbalanced/Entropic OT benchmarks"] C --> D["Computational Process<br>Establish existence & strong duality<br>Derive Benamou-Brenier dynamics"] D --> E["Outcomes<br>Existence of optimal maps<br>perturbative & quadratic regimes"] E --> F["Applications<br>Multi-asset portfolio optimization<br>General mass-modifying transport"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a non‑conservative optimal transport framework that models creation or destruction of mass and applies it to the optimal re‑balancing of a portfolio.
Source sentence
Building on this trajectory, we develop the framework of non-conservative optimal transport. Motivated by this example, non-conservative optimal transport generalizes the classical optimal transport problem by two tweaks.
Assumes 6
- Connectedness: the market graph G is connected. market
Source sentence
A1 Connectedness: G is a connected graph.
- No arbitrage: for every directed cycle Γ in G, the product of prices along the cycle is ≤ 1. market
Source sentence
A2 No arbitrage: For every directed cycle Γ in the graph G it holds Y e∈Γ Pe ≤1.
- Unlimited liquidity and no price impact: assets are liquid and trading does not affect prices. market
Source sentence
A3 Unlimited liquidity and no price impact: Assets are liquid and there is no limit on number of units that can be traded. Trading does not impact prices.
- No transaction costs: there are no fees for trading. execution
Source sentence
A4 No transaction costs: There are no fees for trading. 4 Remark 2.3.
Show 2 more
- Long‑only portfolio: the current portfolio consists only of long positions (xi ≥ 0). model
Source sentence
A5 Long only portfolio: Current portfolio x consists only of long positions, xi ≥0 for i = 1, . . . , N. A6 Target proportions: A vector ν satisfying PN i=1 νi = 1 and νi ≥0 for i = 1, . . . , N is given.
- Target proportions ν are given and sum to one with non‑negative entries. model
Source sentence
A5 Long only portfolio: Current portfolio x consists only of long positions, xi ≥0 for i = 1, . . . , N. A6 Target proportions: A vector ν satisfying PN i=1 νi = 1 and νi ≥0 for i = 1, . . . , N is given.
Data
No dataset named in the text.
Costs
Unclear - sources disagree
Source sentence (the authors' words)
A4 No transaction costs: There are no fees for trading. 4 Remark 2.3.
Finds 3
- Existence of optimal transport plans and strong duality for the non‑conservative OT problem. theoretical
Source sentence
The existence of optimal transport plans and strong duality are established.
- Existence of optimal transport maps in the perturbative mass‑change and quadratic mass‑loss regimes. theoretical
Source sentence
The existence of optimal maps are deduced in two central regimes, i.e., perturbative mass-change and quadratic mass-loss.
- Solution to the optimal re‑balancing problem exists under assumptions A1‑A7. theoretical
Source sentence
Theorem 2.15. Let the assumptions A1-A7 hold. Solution to the optimal re-balancing Problem 2.13 exists.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 10 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (32)
- Gradient flows: in metric spaces and in the space of probability measures (2008)
- A computational fluid mechanics solution to the M onge- K antorovich mass transfer problem (2000)
- Characterization of optimal shapes and masses through M onge- K antorovich equation (2001)
- Portfolio selection with transaction costs (1990)
- Extended K antorovich norms: a tool for optimization (2002)
- An extension of the K antorovich norm (1999)
- Optimal rebalancing of portfolios with transaction costs (2013)
- Markets with Transaction Costs Mathematical Theory (2009)
and 24 more
- On a functional space and certain extremum problems (1957)
- On a space of totally additive functions (1958)
- A new optimal transport distance on the space of finite R adon measures (2016)
- Optimal portfolio management with fixed transaction costs (1995)
- Topics in Optimal Transportation (2003)
- Optimal transport: old and new (2008)
- Convex Analysis (1970)
- Optimal Transport for Applied Mathematicians (2015)
- Free Boundaries in Optimal Transport and the Optimal Partial Transport Problem (2010) — link
- On the Regularity of the Free Boundary in the Optimal Partial Transport Problem (2013) — link
- Optimal Entropy‐Transport Problems and the H ellinger– K antorovich Distance (2018) — link
- An interpolating distance between optimal transport and F isher– R ao metrics (2018)
- Unbalanced Optimal Transport: Dynamic and K antorovich Formulations (2018) — link
- Scaling Algorithms for Unbalanced Transport Problems (2021) — link
- Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplings (2022) — link
- M 'e moire sur la th 'e orie des d 'e blais et des remblais (1781)
- Normalized Wasserstein Distance for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation (2019) — link
- Unnormalized optimal transport (2019)
- On translation of mass (in R ussian), Dokl (1942)
- Principles of Mathematical Analysis (1976) — link
- Chapter 12 - U nbalanced O ptimal T ransport, from theory to numerics (2023) — link
- Fundamentals of Convex Analysis and Optimization : A Supremum Function Approach (2023)
- Introduction to algorithms (2009)
- Information geometry in portfolio theory (2019)
0 of 32 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.