Abstract
We consider an extension of the popular matching problem: the popular condensation problem. An instance of the popular matching problem consists of a set of applicants A and a set of posts P. Each applicant has a strictly ordered preference list, which is a sequence of posts in order of his/her preference. A matching M mapping from A to P is popular if there is no other matching M′ such that more applicants prefer M′ to M than prefer M to M′. Although some efficient algorithms have been proposed for finding a popular matching, a popular matching may not exist for those instances where the competition of some applicants cannot be resolved. The popular condensation problem is to find a popular matching with the minimum number of applicants whose preferences are neglected, that is, to optimally condense the instance to admit a local popular matching. We show that the problem can be solved in O(n + m) time, where n is the number of applicants and posts, and m is the total length of the preference lists.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdulkadiroǧlu, A., Sönmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689–701 (1998)
Abraham, D.J., Cechlárová, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 3–15. Springer, Heidelberg (2004)
Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing 37(4), 1030–1045 (2007)
Abraham, D.J., Kavitha, T.: Dynamic Matching Markets and Voting Paths. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 65–76. Springer, Heidelberg (2006)
Bartholdi, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Mathematical and Computer Modeling 16(8/9), 27–40 (1992)
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)
Gardenfors, P.: Match Making: assignments based on bilateral preferences. Behavioural Sciences 20, 166–173 (1975)
Huang, C.-C., Kavitha, T.: Near-popular matchings in the roommates problem. SIAM Journal on Discrete Mathematics 27(1), 43–62 (2013)
Huang, C.-C., Kavitha, T.: Popular matchings in the stable marriage problem. Information and Computation 222, 180–194 (2013)
Huang, C.-C., Kavitha, T., Michail, D., Nasre, M.: Bounded Unpopularity Matchings. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 127–137. Springer, Heidelberg (2008)
Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Transactions on Algorithms 2(4), 602–610 (2006)
Kavitha, T.: Popularity vs maximum cardinality in the stable marriage setting. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 123–134 (2012)
Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. Theoretical Computer Science 412(24), 2679–2690 (2011)
Kavitha, T., Nasre, M.: Optimal popular matchings. Discrete Applied Mathematics 157(14), 3181–3186 (2009)
Kavitha, T., Nasre, M.: Popular matchings with variable item copies. Theoretical Computer Science 412, 1263–1274 (2011)
Kavitha, T., Nasre, M., Nimbhorkar, P.: Popularity at Minimum Cost. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 145–156. Springer, Heidelberg (2010)
Mahdian, M.: Random popular matchings. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 238–242 (2006)
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)
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)
McDermid, E., Irving, R.W.: Popular matchings: structure and algorithms. Journal of Combinatorial Optimization 22(3), 339–358 (2011)
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)
Paluch, K.: Popular and Clan-Popular b-Matchings. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 116–125. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, YW., Lin, WY., Wang, HL., Chao, KM. (2013). An Optimal Algorithm for the Popular Condensation Problem. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)