Rotation-based formulation for stable matching

Siala, Mohamed; O'Sullivan, Barry

Rotation-based formulation for stable matching

Files

4582.pdf(413.73 KB)

Accepted version

Date

2017-08-23

Authors

Siala, Mohamed

O'Sullivan, Barry

Publisher

Springer International Publishing

Published Version

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

Abstract

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.

Keywords

CP models , Stable marriage (SM) problem , Constraint programming , Balanced stable matching , Constraint theory , Arc consistency , Constraint programming , Filtering rules , Hard instances , Quadratic time , Stable matching , Stable matching problem , State of the art , Computer programming

Citation

Siala, M. and O’Sullivan, B. (2017) 'Rotation-Based Formulation for Stable Matching', in Beck, J.C. (ed.) Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Lecture Notes in Computer Science, LCNS vol. 10416, Cham: Springer International Publishing, pp. 262-277.