Lattice structure of the random stable set in many-to-many matching markets

JUAREZ NOELIA; JORGE OVIEDO; NEME, PABLO A.

VIRTUAL

Congreso; UMA; 2020

UMA

We study the lattice structure of the set of random stable matchings for a manyto-many matching market. We define a partial order on the random stable set andpresent two natural binary operations for computing the least upper bound andthe greatest lower bound for each side of the matching market. Then we provethat with these binary operations the set of random stable matchings forms twodistributive lattices for the appropriate partial order, one for each side of the market.Moreover, these lattices are dual.