The Generalized Popular Condensation Problem

Yen Wei Wu, Wei Yin Lin, Hung Lung Wang, Kun Mao Chao*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)


In this paper, we are concerned with the generalized popular condensation problem, which is an extension of the popular matching problem. An instance of the popular matching problem consists of a set of applicants A, a set of posts P, and a set of preference lists. According to the preference lists, the goal is to match each applicant with at most one unique post so that the resulting matching is “popular.” 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 _. However, such a matching does not always exist. To fulfill the popular matching requirements, a possible manipulation is to neglect some applicants. Given that each applicant is appended with a cost for neglecting, the generalized popular condensation problem asks for a subset of applicants, with minimum sum of costs, whose deletion results in an instance admitting a popular matching. We prove that this problem is NP-hard, and it is also NP-hard to approximate to within a certain factor, assuming ties are involved in the preference lists. For the special case where the costs of all applicants are equal, we show that the problem can be solved in O(√ nm) time, where n is the number of applicants and posts, and m is the total length of the preference lists.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
EditorsHee-Kap Ahn, Chan-Su Shin
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319130743
Publication statusPublished - 2014
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The Generalized Popular Condensation Problem'. Together they form a unique fingerprint.

Cite this