Rotation-Based Formulation for Stable Matching
Refereed Conference Meeting Proceeding
We introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time. Our experimental study on hard instances of sex-equal and balanced stable matching shows the efficiency of one of our propositions as compared with the state-of-the-art constraint programming approach.
International Conference on Principles and Practice of Constraint Programming, CP 2017
Digital Object Identifer (DOI):
National University of Ireland, Cork (UCC)
Open access repository: