Stable matchings, one-sided ties, and approximate popularity

Cites Work

Matching theory
Some remarks on the stable matching problem
College Admissions and the Stability of Marriage
Size versus stability in the marriage problem
Coverings of Bipartite Graphs
Popular matchings in the marriage and roommates problems
Title not available (Why is that?)
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
Popular matchings and limits to tractability
Better and simpler approximation algorithms for the stable marriage problem
Hard variants of stable marriage.
A \(1.875\)-approximation algorithm for the stable marriage problem
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists
Improved approximation algorithms for two variants of the stable marriage problem with ties
Popular matchings in the stable marriage problem
A Size-Popularity Tradeoff in the Stable Marriage Problem
Unpopularity factor in the marriage and roommates problems
Popular matchings with two-sided preferences and one-sided ties
Maximum stable matching with one-sided ties of bounded length
Two problems in max-size popular matchings
Maintaining Near-Popular Matchings
Near-popular matchings in the roommates problem
Quasi-popular matchings, optimality, and extended formulations
Stable matchings with one-sided ties and approximate popularity

This page was built for publication: Stable matchings, one-sided ties, and approximate popularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547210)