Center for Algorithms and Theory of Computation

CS 269S, Spring 2018: Theory Seminar
Bren Hall, Room 1423, 1pm


April 20, 2018:

Distributive lattices, stable matchings, and robust solutions

Vijay Vazirani, UCI

The deep and pristine structure of stable matchings has been explored by numerous researchers and has been utilized for obtaining efficient algorithms for numerous questions related to this problem, ever since its introduction in 1962 by Gale and Shapley.

In this talk, I will present new structural results and algorithms from three recent joint papers with Tung Mai.

https://arxiv.org/pdf/1802.06621.pdf

https://arxiv.org/pdf/1804.00553.pdf

https://arxiv.org/pdf/1804.05537.pdf