Free reading is over, click to pay to read the rest ... pages
0 dollars,0 people have bought.
Reading is over. You can download the document and read it offline
0people have downloaded it
Document pages: 30 pages
Abstract: For a many-to-many matching market, we study the lattice structure of the setof random stable matchings. We define a partial order on the random stable setand present two intuitive binary operations to compute the least upper boundand the greatest lower bound for each side of the matching market. Then, weprove that with these binary operations the set of random stable matchingsforms two dual lattices.
Document pages: 30 pages
Abstract: For a many-to-many matching market, we study the lattice structure of the setof random stable matchings. We define a partial order on the random stable setand present two intuitive binary operations to compute the least upper boundand the greatest lower bound for each side of the matching market. Then, weprove that with these binary operations the set of random stable matchingsforms two dual lattices.