Popular Matchings in the Marriage and Roommates Problems
Popular matchings have recently been a subject of study in the context of the so-called House Allocation Problem, where the objective is to match applicants to houses over which the applicants have preferences. A matching M is called popular if there is no other matching M′ with the property that more applicants prefer their allocation in M′ to their allocation in M. In this paper we study popular matchings in the context of the Roommates Problem, including its special (bipartite) case, the Marriage Problem. We investigate the relationship between popularity and stability, and describe efficient algorithms to test a matching for popularity in these settings. We also show that, when ties are permitted in the preferences, it is NP-hard to determine whether a popular matching exists in both the Roommates and Marriage cases.
Unable to display preview. Download preview PDF.
- 3.Biró, P., Irving, R.W., Manlove, D.F.: Popular matchings in the Marriage and Roommates problems. Technical Report TR-2009-306, University of Glasgow, Department of Computing Science (December 2009)Google Scholar
- 17.Mahdian, M.: Random popular matchings. In: Proceedings of EC 2006: the 7th ACM Conference on Electronic Commerce, pp. 238–242. ACM, New York (2006)Google Scholar
- 23.O’Malley, G.: Algorithmic Aspects of Stable Matching Problems. PhD thesis, University of Glasgow, Department of Computing Science (2007)Google Scholar
- 26.Sng, C.T.S.: Efficient Algorithms for Bipartite Matching Problems with Preferences. PhD thesis, University of Glasgow, Department of Computing Science (2008)Google Scholar