A CP-Based Approach for Popular Matching
DOI:
https://doi.org/10.1609/aaai.v30i1.9944Keywords:
Constraint Programming, Popular matching, PreferencesAbstract
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.
Downloads
Published
2016-03-05
How to Cite
Chisca, D., Siala, M., Simonin, G., & O’Sullivan, B. (2016). A CP-Based Approach for Popular Matching. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.9944
Issue
Section
Student Abstracts and Posters