Siala, Mohamed; O’Sullivan, Barry; Beck, J. Christopher

2017 August

Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings. Lecture Notes in Computer Science, vol 10416

Rotation-Based Formulation for Stable Matching

Springer International Publishing

Cham

Published

1

CP models Stable marriage (SM) problem Constraint programming Balanced 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.

Beck, J.

978-3-319-66158-2

https://doi.org/10.1007/978-3-319-66158-2_17

262

277

10.1007/978-3-319-66158-2_17