Popular matchings in the stable marriage problem

23Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

We consider the problem of computing a maximum cardinality popular matching in a bipartite graph G=(A∪B,E) where each vertex u∈A∪B ranks its neighbors in a strict order of preference. Such a graph is called an instance of the stable marriage problem with strict preferences and incomplete lists. A matching M* is popular if for every matching M in G, the number of vertices that prefer M to M* is at most the number of vertices that prefer M* to M. Every stable matching of G is popular, however a stable matching is a minimum cardinality popular matching. The complexity of computing a maximum cardinality popular matching was unknown. In this paper we show a simple characterization of popular matchings in G=(A∪B,E). We also show a sufficient condition for a popular matching to be a maximum cardinality popular matching. We construct a matching that satisfies our characterization and sufficient condition in O(mn0) time, where m=|E| and n 0=min(|A|,|B|). Thus the maximum cardinality popular matching problem in G=(A∪B,E) can be solved in O(mn0) time. © 2012 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Huang, C. C., & Kavitha, T. (2013). Popular matchings in the stable marriage problem. In Information and Computation (Vol. 222, pp. 180–194). https://doi.org/10.1016/j.ic.2012.10.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free