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

From MaRDI portal
Publication:2078071




Abstract: 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.









This page was built for publication: Lattice structure of the random stable set in many-to-many matching markets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078071)