Finding a minimum-regret many-to-many Stable Matching

DOI10.1080/02331934.2012.690154MaRDI QIDQ2868914zbMATH OpenOpenAlexFDO

Authors Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos, Panayiotis Miliotis

Publication date 19 December 2013

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2012.690154

zbMATH Keywords

distributive latticeminimum-regretoptimalityrotationstable matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Finding all stable pairs and solutions to the many-to-many stable matching problem
• The stability of many-to-many matching with max-min preferences
• Finding large stable matchings
• A generalization of the stable matching problem
• A New Approach to Stable Matching Problems
• An improved approximation lower bound for finding almost stable maximum matchings
• Finding a stable matching under type-specific minimum quotas
• Faster and simpler approximation of stable matchings
• Faster and simpler approximation of stable matchings

Cites work

• An algorithm to compute the full set of many-to-many stable matchings.
• Assigning papers to referees
• College Admissions and the Stability of Marriage
• Finding all stable pairs and solutions to the many-to-many stable matching problem
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• On the stable b-matching polytope.
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Three Fast Algorithms for Four Problems in Stable Marriage
• Three remarks on the many-to-many stable matching problem

Cited in

(3)

• Blockers and antiblockers of stable matchings
• Lazy Gale-Shapley for many-to-one matching with partial information
• Finding all stable pairs and solutions to the many-to-many stable matching problem

This page was built for publication: Finding a minimum-regret many-to-many Stable Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868914)