Popularity vs maximum cardinality in the stable marriage setting

@inproceedings{Kavitha2012PopularityVM,
  title={Popularity vs maximum cardinality in the stable marriage setting},
  author={Telikepalli Kavitha},
  booktitle={SODA},
  year={2012}
}
Given a bipartite graph G = (A ∪ B, E) where each vertex ranks its neighbors in a strict order of preference, we consider the problem of computing a largest matching in the set of popular matchings in G. A matching M is said to be popular if there is no matching where more vertices are happier than in M . The set of popular matchings is non-empty since… CONTINUE READING