Revisiting two-sided stability constraints

Thumbnail Image
Files
16-cpaior.pdf(365.05 KB)
Accepted Version
Date
2016-05
Authors
Siala, Mohamed
O'Sullivan, Barry
Journal Title
Journal ISSN
Volume Title
Publisher
Springer International Publishing
Published Version
10.1007/978-3-319-33954-2_25
Research Projects
Organizational Units
Journal Issue
Abstract
We show that previous filtering propositions on two-sided stability problems do not enforce arc consistency (AC), however they maintain Bound(D) Consistency (BC(D)). We propose an optimal algorithm achieving BC(D) with O(L) time complexity where L is the length of the preference lists. We also show an adaptation of this filtering approach to achieve AC. Next, we report the first polynomial time algorithm for solving the hospital/resident problem with forced and forbidden pairs. Furthermore, we show that the particular case of this problem for stable marriage can be solved in O(n2) which improves the previously best complexity by a factor of n2. Finally, we present a comprehensive set of experiments to evaluate the filtering propositions.
Description
Keywords
Two-sided stability , Arc consistency , Polynomial
Citation
Siala, M. and O’Sullivan, B. (2016) 'Revisiting Two-Sided Stability Constraints', in Quimper, C.-G. (ed.) Integration of AI and OR Techniques in Constraint Programming: 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Lecture Notes in Computer Science, vol. 9676, Cham: Springer International Publishing, pp. 342-357. doi: 10.1007/978-3-319-33954-2_25
URI
https://hdl.handle.net/10468/2480
Collections
Insight Centre for Data Analytics - Conference Items
Computer Science - Conference Items
Copyright
© Springer International Publishing AG. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-33954-2_25