Unsworth, C. and Prosser, P. (2005) A specialised binary constraint for the stable marriage problem. Lecture Notes in Computer Science, 3607, pp. 218-233. (doi: 10.1007/11527862_16)
|
Text
stable_marriage.pdf 182kB |
Publisher's URL: http://dx.doi.org/10.1007/11527862_16
Abstract
We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and women we require n2 of these constraints, and the complexity of enforcing arc-consistency is O(n3). Although this is non-optimal, empirical evidence suggests that in practical terms our encoding significantly outperforms the optimal encoding given in [7] in both space and time.
Item Type: | Articles |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Unsworth, Dr Chris and Prosser, Dr Patrick |
Authors: | Unsworth, C., and Prosser, P. |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | Lecture Notes in Computer Science |
Publisher: | Springer |
ISSN: | 0302-9743 |
Copyright Holders: | Copyright © Springer 2006 |
First Published: | First published in Lecture Notes in Computer Science 3670:218-233 |
Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher |
University Staff: Request a correction | Enlighten Editors: Update this record