Rotation-Based Formulation for Stable Matching
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.
We thank the anonymous reviewers for their constructive comments that helped to improve the presentation of the paper.
We thank Begum Genc for generating the instances.
This publication has emanated from research conducted with the financial support of Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289.
- 10.Hebrard, E.: Mistral, a constraint satisfaction library. In: Proceedings of the CP 2008 Third International CSP Solvers Competition, pp. 31–40 (2008)Google Scholar
- 16.Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, 18–22 June 2001, pp. 530–535 (2001)Google Scholar
- 19.Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2. Elsevier (2006)Google Scholar
- 22.Unsworth, C., Prosser, P.: An n-ary constraint for the stable marriage problem. CoRR, abs/1308.0183 (2013)Google Scholar