A note on many-to-many matchings and stable allocations

DOI10.1016/j.dam.2015.08.013zbMath1330.05120OpenAlexW1759895908MaRDI QIDQ5962526

Mourad Baïou

Publication date: 12 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.013

zbMATH Keywords

mechanism designmany-to-many matchingstable matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The stable \(b\)-matching polytope revisited

Cites Work

• Many-to-many matching with max-min preferences
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Characterizations of the optimal stable allocation mechanism

This page was built for publication: A note on many-to-many matchings and stable allocations