Binary operations for the lattice structure in a many-to-many matching model
From MaRDI portal
Publication:2033997
DOI10.1007/S40305-019-00246-ZzbMATH Open1474.91113OpenAlexW2944544019MaRDI QIDQ2033997FDOQ2033997
Authors: Paola Belén Manasero 
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
Recommendations
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- Lattice structure of the random stable set in many-to-many matching markets
- Binary operations and lattice structure for a model of matching with contracts
- On preferences over subsets and the lattice structure of stable matchings
- A note on the lattice structure for matching markets via linear programming
Cites Work
- Title not available (Why is that?)
- Some remarks on the stable matching problem
- College Admissions and the Stability of Marriage
- The college admissions problem is not equivalent to the marriage problem
- A class of multipartner matching markets with a strong lattice structure
- Job Matching, Coalition Formation, and Gross Substitutes
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Substitutes and stability for matching with contracts
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
- Core many-to-one matchings by fixed-point methods
- Binary operations and lattice structure for a model of matching with contracts
- Equivalences between two matching models: stability
Cited In (9)
- Binary operations and lattice structure for a model of matching with contracts
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- Lattice structure of the random stable set in many-to-many matching markets
- The lattice of envy-free matchings
- A note on the lattice structure for matching markets via linear programming
- On preferences over subsets and the lattice structure of stable matchings
- Cycles to compute the full set of many-to-many stable matchings
- The lattice of worker-quasi-stable matchings
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
This page was built for publication: Binary operations for the lattice structure in a many-to-many matching model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033997)
