The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
DOI10.1007/978-3-540-78773-0_51zbMATH Open1136.91543OpenAlexW1525480452MaRDI QIDQ5458562FDOQ5458562
Authors: Richard Matthew McCutchen 
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_51
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Cited In (30)
- Minimal envy and popular matchings
- The generalized popular condensation problem
- A pessimist's approach to one-sided matching
- Finding and Recognizing Popular Coalition Structures
- Popular matchings with two-sided preferences and one-sided ties
- Maintaining Near-Popular Matchings
- Popular mixed matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Popular branchings and their dual certificates
- Maximum locally stable matchings
- Popular and clan-popular \(b\)-matchings
- Random popular matchings with incomplete preference lists
- Unpopularity factor in the marriage and roommates problems
- Quasi-popular matchings, optimality, and extended formulations
- Popular Matchings: Structure and Algorithms
- Popular matchings with two-sided preferences and one-sided ties
- Maximum matchings and popularity
- Popular branchings and their dual certificates
- Bounded unpopularity matchings
- Popular matchings with weighted voters
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Bounded Unpopularity Matchings
- Popular matchings in the weighted capacitated house allocation problem
- Popular matchings in the stable marriage problem
- The dynamics of rank-maximal and popular matchings
- Social welfare in one-sided matching markets without money
- Computational complexity of \(k\)-stable matchings
- Stable matchings, one-sided ties, and approximate popularity
- Popular ranking
This page was built for publication: The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458562)
