Bounded Unpopularity Matchings
From MaRDI portal
Publication:3512453
DOI10.1007/978-3-540-69903-3_13zbMath1155.91436OpenAlexW1529648317WikidataQ62045792 ScholiaQ62045792MaRDI QIDQ3512453
Dimitrios Michail, Meghana Nasre, Chien-Chung Huang, Telikepalli Kavitha
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_13
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Related Items (11)
Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Bounded Unpopularity Matchings ⋮ Popular matchings with variable item copies ⋮ Popular matchings: structure and algorithms ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular mixed matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Unpopularity factor in the marriage and roommates problems ⋮ Social Welfare in One-Sided Matching Markets without Money ⋮ Random Popular Matchings with Incomplete Preference Lists
Cites Work
- Unnamed Item
- Weak versus strong domination in a market with indivisible goods
- Residence exchange wanted: A stable residence exchange problem
- On a conjecture by Gale about one-sided matching problems
- Rank-maximal matchings
- Bounded Unpopularity Matchings
- Popular Matchings
- Weighted Popular Matchings
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Popular Matchings in the Capacitated House Allocation Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Algorithms and Computation
- College Admissions and the Stability of Marriage
This page was built for publication: Bounded Unpopularity Matchings
