Abraham, David J and Irving, Robert W and Kavitha, Telikepalli and Mehlhorn, Kurt
(2007)
*Popular Matchings.*
In: SIAM Journal on Computing, 37
(4).
pp. 1030-1045.

PDF
siam.pdf - Published Version Restricted to Registered users only Download (294Kb) | Request a copy |

## Abstract

We consider the problem of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a nonempty subset of posts in order of preference, possibly involving ties. We say that a matching M is popular if there is no matching $M'$ such that the number of applicants preferring $M'$ to M exceeds the number of applicants preferring M to $M'$. In this paper, we give the first polynomial-time algorithms to determine if an instance admits a popular matching and to find a largest such matching, if one exists. For the special case in which every preference list is strictly ordered (i.e., contains no ties), we give an $O(n+m)$ time algorithm, where n is the total number of applicants and posts and m is the total length of all of the preference lists. For the general case in which preference lists may contain ties, we give an $O(\sqrt{n}m)$ time algorithm.

Item Type: | Journal Article |
---|---|

Related URLs: | |

Additional Information: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |

Keywords: | matchings;bipartite graphs;one-sided preference lists. |

Department/Centre: | Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation) |

Date Deposited: | 03 Jul 2008 |

Last Modified: | 22 Feb 2012 10:08 |

URI: | http://eprints.iisc.ernet.in/id/eprint/14509 |

### Actions (login required)

View Item |