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

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.