Near-Popular Matchings in the Roommates Problem
Abstract
Our input is a graph G = (V, E) where each vertex ranks its neighbors in a strict order of preference. The problem is to compute a matching in G that captures the preferences of the vertices in a popular way. Matching M is more popular than matching M′ if the number of vertices that prefer M to M′ is more than those that prefer M′ to M. The unpopularity factor of M measures by what factor any matching can be more popular than M. We show that G always admits a matching whose unpopularity factor is O(log|V|) and such a matching can be computed in linear time. In our problem the optimal matching would be a least unpopularity factor matching - we show that computing such a matching is NP-hard. In fact, for any ε > 0, it is NP-hard to compute a matching whose unpopularity factor is at most 4/3 − ε of the optimal.
Keywords
Stable Match Satisfying Assignment Preference List Arbitrary Permutation Stable PartitionPreview
Unable to display preview. Download preview PDF.
References
- 1.Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing 37(4), 1030–1045 (2007)MathSciNetCrossRefMATHGoogle Scholar
- 2.Biró, P., Irving, R.W., Manlove, D.F.: Popular Matchings in the Marriage and Roommates Problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97–108. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 3.Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)MathSciNetCrossRefMATHGoogle Scholar
- 4.Gärdenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Sciences 20, 166–173 (1975)CrossRefGoogle Scholar
- 5.Garey, M., Johnson, D.: Computers and Intractablility. Freeman, New York (1979)Google Scholar
- 6.Huang, C.-C., Kavitha, T.: Popular Matchings in the Stable Marriage Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 666–677. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- 7.Irving, R.W.: An Efficient Algorithm for the “Stable Roommates” Problem. Journal of Algorithms 6, 577–595 (1985)MathSciNetCrossRefMATHGoogle Scholar
- 8.Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 574–584. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 9.Mahdian, M.: Random popular matchings. In: Proceedings of the ACM EC 2006, pp. 238–242 (2006)Google Scholar
- 10.Manlove, D.F., Sng, C.T.S.: Popular matchings in the capacitated house allocation problem. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 492–503. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 11.McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 593–604. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 12.Mestre, J.: Weighted popular matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 715–726. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 13.Tan, J.J.M.: A necessary and sufficient condition for the existence of a complete stable matching. Journal of Algorithms 12, 154–178 (1991)MathSciNetCrossRefMATHGoogle Scholar