Envy-freeness and relaxed stability: hardness and approximation algorithms
From MaRDI portal
Publication:5925588
DOI10.1007/S10878-022-00963-XOpenAlexW4313256358MaRDI QIDQ5925588
Prem Krishnaa, Meghana Nasre, Girija Limaye, Prajakta Nimbhorkar
Publication date: 4 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00963-x
Related Items (4)
Strategyproof mechanism for two-sided matching with resource allocation ⋮ Refined computational complexities of hospitals/residents problem with regional caps ⋮ Popular critical matchings in the many-to-many setting ⋮ Critical Relaxed Stable Matchings with Two-Sided Ties
Cites Work
- Unnamed Item
- The hospitals/residents problem with lower quotas
- Strategyproof matching with regional minimum and maximum quotas
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Stability concepts in matching under distributional constraints
- The college admissions problem with lower and common quotas
- The lattice of envy-free matchings
- Envy-free matchings with lower quotas
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- A Matroid Approach to Stable Matchings with Lower Quotas
- The importance of being biased
- Improved approximation results for the stable marriage problem
- Popular Matchings with Lower Quotas
- How Good Are Popular Matchings
- College Admissions and the Stability of Marriage
- Envy-freeness and relaxed stability: hardness and approximation algorithms
This page was built for publication: Envy-freeness and relaxed stability: hardness and approximation algorithms
