AAAI Publications, Thirtieth AAAI Conference on Artificial Intelligence

Font Size: 
A CP-Based Approach for Popular Matching
Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan

Last modified: 2016-03-05


We propose a constraint programming approach to the popular matching problem. We show that one can use the Global Cardinality Constraint to encode the problem even in cases that involve ties in the ordinal preferences of the applicants.


Constraint Programming; Popular matching; Preferences

Full Text: PDF