Bounded unpopularity matchings
From MaRDI portal
Publication:644804
DOI10.1007/s00453-010-9434-9zbMath1225.68097OpenAlexW1971903577WikidataQ62045777 ScholiaQ62045777MaRDI QIDQ644804
Dimitrios Michail, Telikepalli Kavitha, Meghana Nasre, Chien-Chung Huang
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Matching models (91B68)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal popular matchings
- Weak versus strong domination in a market with indivisible goods
- Residence exchange wanted: A stable residence exchange problem
- Stable marriage and indifference
- On a conjecture by Gale about one-sided matching problems
- Popular Matchings
- Weighted Popular Matchings
- Popular Mixed Matchings
- Popular Matchings with Variable Job Capacities
- The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Popular Matchings: Structure and Algorithms
- Popular Matchings in the Capacitated House Allocation Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Algorithms and Computation
- College Admissions and the Stability of Marriage
This page was built for publication: Bounded unpopularity matchings
