For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define the least upper bound and the greatest lower bound for both sides of the matching market , and we prove that with these binary operations the set of random stable matchings forms two dual lattices.
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and the greatest lower bound for each side of the matching market . Then, we prove that with these binary operations the set of random stable matchings forms two dual lattices.
R
the
a partial order on the random stable set and present two intuitive binary operations to compute the
R
both sides
each side
R
, and
. Then,