Conference Publication Details
Mandatory Fields
Chisca, Danuta Sorina; Siala, Mohamed; Simonin, Gilles; O'Sullivan, Barry
ICTAI 2017: The annual IEEE International Conference on Tools with Artificial Intelligence
New Models for Two Variants of Popular Matching
2017
Unknown
In Press
1
()
Optional Fields
Boston, MA, USA
06-NOV-17
08-NOV-17
We study the problem of matching a set of applicants to a set of posts, where each applicant has an ordinal preference list, which may contain ties, ranking a subset of posts. A matching M is popular if there exists no matching M0 where more applicants prefer M0 to M. Several notions of optimality are studied in the literature for the case of strictly ordered preference lists. In this paper we address the case involving ties and propose novel algorithmic and complexity results for this variant. Next, we focus on the NP-hard case where additional copies of posts can be added in the preference lists, called Popular Matching with Copies. We define new dominance rules for this problem and present several novel graph properties characterising the posts that should be copied with priority. We present a comprehensive set of experiments for the popular matching problem with copies to evaluate our dominance rules as well as the different branching strategies. Our experimental study emphasizes the importance of the dominance rules and characterises the key aspects of a good branching strategy.
Grant Details
Science Foundation Ireland
SFI/12/RC/2289