18 November 2022
The Structure of Stable Matching Lattices
Abstract: The stable matching problem looks to match n workers and n firms such that no unmatched worker and firm pair prefers each other to their partners. The set of matching stable for an instance forms a lattice under the preferences of the workers. We look at the rotations that generate this lattice and the structure of the set of matchings stable under multiple instances.
Based on joint work with Rohith Reddy Gangam, Tung Mai and Vijay Vazirani