Popularity vs maximum cardinality in the stable marriage setting
From MaRDI portal
Publication:5743383
zbMATH Open1423.05173MaRDI QIDQ5743383FDOQ5743383
Authors: Telikepalli Kavitha 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095127
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- Some remarks on the stable matching problem
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Size versus stability in the marriage problem
- Popular matchings in the stable marriage problem
- Popular matchings in the marriage and roommates problems
- Popular Matchings
- Popular Matchings in the Capacitated House Allocation Problem
- Optimal popular matchings
- Better and simpler approximation algorithms for the stable marriage problem
- Weighted Popular Matchings
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Popular Mixed Matchings
- Popular Matchings: Structure and Algorithms
Cited In (7)
- The generalized popular condensation problem
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Popularity in the generalized hospital residents setting
- Two problems in max-size popular matchings
- Popular matchings in the stable marriage problem
This page was built for publication: Popularity vs maximum cardinality in the stable marriage setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743383)
