Bounded Unpopularity Matchings
From MaRDI portal
Recommendations
Cites work
- Algorithms and Computation
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Bounded Unpopularity Matchings
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- On a conjecture by Gale about one-sided matching problems
- Popular Matchings
- Popular Matchings in the Capacitated House Allocation Problem
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Rank-maximal matchings
- Residence exchange wanted: A stable residence exchange problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Weak versus strong domination in a market with indivisible goods
- Weighted Popular Matchings
Cited in
(14)- Unpopularity factor in the marriage and roommates problems
- Popular and clan-popular b-matchings
- The generalized popular condensation problem
- Social welfare in one-sided matching markets without money
- Bounded Unpopularity Matchings
- Popular matchings with variable job capacities
- Random popular matchings with incomplete preference lists
- Popular Matchings: Structure and Algorithms
- Popular mixed matchings
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Popular matchings with variable item copies
- Bounded unpopularity matchings
- Popular matchings: structure and algorithms
- Popular matchings in the weighted capacitated house allocation problem
This page was built for publication: Bounded Unpopularity Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512453)