Finding a minimum-regret many-to-many Stable Matching
From MaRDI portal
Publication:2868914
DOI10.1080/02331934.2012.690154zbMath1278.90336OpenAlexW1991197788MaRDI QIDQ2868914
Panayiotis Miliotis, Pavlos Eirinakis, Ioannis Mourtos, Dimitrios Magos
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
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Three remarks on the many-to-many stable matching problem
- On the stable \(b\)-matching polytope.
- An algorithm to compute the full set of many-to-many stable matchings.
- Assigning papers to referees
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
- Three Fast Algorithms for Four Problems in Stable Marriage
- College Admissions and the Stability of Marriage
This page was built for publication: Finding a minimum-regret many-to-many Stable Matching
