Stable matchings, one-sided ties, and approximate popularity
From MaRDI portal
Publication:6547210
DOI10.1007/s00453-024-01215-6MaRDI QIDQ6547210
Publication date: 30 May 2024
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Size versus stability in the marriage problem
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Some remarks on the stable matching problem
- Matching theory
- Hard variants of stable marriage.
- Popular matchings in the stable marriage problem
- Unpopularity factor in the marriage and roommates problems
- Two problems in max-size popular matchings
- Coverings of Bipartite Graphs
- Maintaining Near-Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Popular Matching in Roommates Setting Is NP-hard
- Quasi-Popular Matchings, Optimality, and Extended Formulations
- Popular Matchings and Limits to Tractability
- A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists
- Near-Popular Matchings in the Roommates Problem
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- College Admissions and the Stability of Marriage
- Maximum stable matching with one-sided ties of bounded length
- Stable matchings with one-sided ties and approximate popularity
This page was built for publication: Stable matchings, one-sided ties, and approximate popularity
