Stable Matching as Transportation

We study matching markets with aligned preferences and establish a connection with the canonical optimal transportation problem. Stable matchings are approximated by solutions to certain convex optimal transport problems, while egalitarian matchings are approximated by concave problems. Our approach describes structural properties of stable matchings in specific markets. The results generalize to multi-sided matching problems, and allow us to consider team formation, supply chain, and other applications.

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.