A CP-Based Approach to Popular Matching

Danuta Sorina Chisca (1) , Mohamed Siala (1) , Gilles Simonin (1) , Barry O ' Sullivan (1)

1 INSIGHT - Insight Centre for Data Analytics

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.

Domaines: Intelligence artificielle [cs.AI]; Autre [cs.OH]

Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O ' Sullivan. A CP-Based Approach to Popular Matching. AAAI 2016, Feb 2016, Phoenix, United States. ⟨hal-01689926⟩