A CP-Based Approach for Popular Matching

Danuta Chisca; Mohamed Siala; Gilles Simonin; Barry O'Sullivan

doi:10.1609/aaai.v30i1.9944

A CP-Based Approach for Popular Matching

Authors

Danuta Chisca University College Cork
Mohamed Siala University College Cork
Gilles Simonin University College Cork
Barry O'Sullivan University College Cork

DOI:

https://doi.org/10.1609/aaai.v30i1.9944

Keywords:

Constraint Programming, Popular matching, Preferences

Abstract

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