arXiv (All)
open access
A geometrically linear approximation of min-max optimal matching
In this work we establish a connection between the min-max optimal matching in the critical dimension $d=2$ and a simpler, geometrically linear, action of random curves in a Brownian potential. This is done by following Leighton and Shor and working with the dual formulation, which we approximate by
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Power of Simple Mechanisms: A Tight $e$-Approximation for Gains from Trade in Matching Markets#1142298
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#798627
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- Martingale deep neural network for very high-dimensional stochastic optimal controls#1075963
- Saturation-Insensitive Dueling Bandits with General Function Approximation#1117723
Record · ID 986011
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive