Authors prove a minimax theorem for bilinear transport from zero-sum games, derive an explicit endpoint cost below critical interaction strength, and show the resulting NMK plans admit Monge solutions given by gradients of convex or concave functions.
Gra- dient flows and riemannian structure in the gromov-wasserstein geometry.arXiv preprint arXiv:2407.11800, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A minimax Bilinear Transport Problem and Nash-Monge-Kantorovich Maps
Authors prove a minimax theorem for bilinear transport from zero-sum games, derive an explicit endpoint cost below critical interaction strength, and show the resulting NMK plans admit Monge solutions given by gradients of convex or concave functions.