Binary operations for the lattice structure in a many-to-many matching model

DOI10.1007/S40305-019-00246-ZMaRDI QIDQ2033997zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lattice structurebinary operationsmany-to-many matching model

Mathematics Subject Classification ID

Matching models (91B68)

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

• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• A Fixed-Point Approach to Stable Matchings and Some Applications
• A class of multipartner matching markets with a strong lattice structure
• A new proof of the lattice structure of many-to-many pairwise-stable matchings
• Binary operations and lattice structure for a model of matching with contracts
• College Admissions and the Stability of Marriage
• Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
• Core many-to-one matchings by fixed-point methods
• Equivalences between two matching models: stability
• Job Matching, Coalition Formation, and Gross Substitutes
• On the lattice structure of the set of stable matchings for a many-to-one model^∗
• Some remarks on the stable matching problem
• Substitutes and stability for matching with contracts
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• The college admissions problem is not equivalent to the marriage problem

Cited in

(9)

• On the lattice structure of the set of stable matchings for a many-to-one model^∗
• On preferences over subsets and the lattice structure of stable matchings
• Cycles to compute the full set of many-to-many stable matchings
• A note on the lattice structure for matching markets via linear programming
• Binary operations and lattice structure for a model of matching with contracts
• Lattice structure of the random stable set in many-to-many matching markets
• A new proof of the lattice structure of many-to-many pairwise-stable matchings
• The lattice of worker-quasi-stable matchings
• The lattice of envy-free 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)