A new proof of the lattice structure of many-to-many pairwise-stable matchings

DOI10.1007/s40305-014-0049-8zbMath1305.91190OpenAlexW1991145024MaRDI QIDQ489140

Jian-Rong Li

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0049-8

zbMATH Keywords

latticecardinal monotonicitypairwise-stable matching

Mathematics Subject Classification ID

Complete distributivity (06D10) Matching models (91B68)

Related Items (3)

Cycles to compute the full set of many-to-many stable matchings ⋮ Binary operations for the lattice structure in a many-to-many matching model ⋮ Lattice structure of the random stable set in many-to-many matching markets

Cites Work

• Contract design and stability in many-to-many matching
• The college admissions problem is not equivalent to the marriage problem
• Three remarks on the many-to-many stable matching problem
• A class of multipartner matching markets with a strong lattice structure
• Credible group stability in many-to-many matching problems
• Stability and Polarization of Interests in Job Matching
• Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• Job Matching, Coalition Formation, and Gross Substitutes
• A Note on Roth's Consensus Property of Many-to-One Matching
• College Admissions and the Stability of Marriage

This page was built for publication: A new proof of the lattice structure of many-to-many pairwise-stable matchings