Critical Relaxed Stable Matchings with Two-Sided Ties
From MaRDI portal
Publication:6496558
DOI10.1007/978-3-031-43380-1_32MaRDI QIDQ6496558
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- The hospitals/residents problem with lower quotas
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Better and simpler approximation algorithms for the stable marriage problem
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Hard variants of stable marriage.
- Linear time local approximation algorithm for maximum stable marriage
- Faster and simpler approximation of stable matchings
- Envy-free matchings with lower quotas
- Stability and Polarization of Interests in Job Matching
- Popular Matchings in the Marriage and Roommates Problems
- Improved approximation results for the stable marriage problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Popular Matchings with Lower Quotas
- A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists
- College Admissions and the Stability of Marriage
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
This page was built for publication: Critical Relaxed Stable Matchings with Two-Sided Ties
