Bounded unpopularity matchings

DOI10.1007/S00453-010-9434-9MaRDI QIDQ644804zbMATH OpenOpenAlexWikidataFDO

Authors Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre

Publication date 7 November 2011

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-010-9434-9

zbMATH Keywords

approximation algorithmsmatching with preferencespopularity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Matching models (91B68)

Recommendations

• Bounded Unpopularity Matchings
• Popular Matchings
• Popular matchings
• Unpopularity factor in the marriage and roommates problems
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences

Cites work

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 6469133 (Why is no real title available?)
• Algorithms and Computation
• College Admissions and the Stability of Marriage
• On a conjecture by Gale about one-sided matching problems
• Optimal popular matchings
• Popular Matchings
• Popular Matchings in the Capacitated House Allocation Problem
• Popular Matchings: Structure and Algorithms
• Popular Mixed Matchings
• Popular matchings with variable job capacities
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Residence exchange wanted: A stable residence exchange problem
• Stable marriage and indifference
• The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
• 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

(6)

• Popular matchings with variable job capacities
• Unpopularity factor in the marriage and roommates problems
• Computational complexity of \(k\)-stable matchings
• The dynamics of rank-maximal and popular matchings
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• Bounded Unpopularity Matchings

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 Q644804)