Apr. 3 (10:00-11:00) room C.510
Zsuzsanna Jankó (Corvinus)
Stable matchings and distributive lattices
It is a classic result that the set of one-to-one stable matchings form a distributive lattice. We generalize this to many-to-many matchings with substitutable and IRC choice functions, and show that the lattice of the solutions is distributive. We know one-to-one stable matchings have rotations, we look at how to find something similar in many-to-many matchings.