Binary operations for the lattice structure in a many-to-many matching model
From MaRDI portal
Publication:2033997
DOI10.1007/s40305-019-00246-zzbMath1474.91113OpenAlexW2944544019MaRDI QIDQ2033997
Publication date: 18 June 2021
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-019-00246-z
Cites Work
- Unnamed Item
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- A class of multipartner matching markets with a strong lattice structure
- Equivalences between two matching models: stability
- Core many-to-one matchings by fixed-point methods
- Substitutes and stability for matching with contracts
- Binary operations and lattice structure for a model of matching with contracts
- 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
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
This page was built for publication: Binary operations for the lattice structure in a many-to-many matching model