~/talk

Stable Matching by Optimal Transport

links:none on file
slides:none on file

Introduces a model with aligned preferences (u=v) and uses optimal transport to show concrete links: a family of transport costs c_alpha = (1/alpha)(1−e^{alpha u}) yields approximate stability for large positive alpha (epsilon ≈ log 2 / alpha) and approximate egalitarianism for large negative alpha (epsilon–delta tradeoff), proves existence of stable matchings as limits of OT solutions in infinite markets, and derives 1‑D non-crossing (cyclic monotonicity) structure relevant to organ exchange and team formation.

AI-written summary · about

  1. 0:00Introduction to aligned matching
  2. 2:35Infinite market dynamics
  3. 6:33Stability versus fairness
  4. 9:44Optimal transport framework
  5. 12:29Formal definitions and stability
  6. 16:44Defining egalitarian outcomes
  7. 18:55Cost functions and optimization
  8. 22:23Existence and structural results
  9. 26:11Cyclic monotonicity
  10. 30:27Ordinal preferences and conclusions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.