A specialised binary constraint for the stable marriage problem

Authors:
Chris Unsworth;Patrick Prosser
Affiliations:
Department of Computing Science, University of Glasgow, Scotland;Department of Computing Science, University of Glasgow, Scotland
Venue:
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Year:
2005

Citing 8
Cited 1

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming

Interfaces
Hard variants of stable marriage

Theoretical Computer Science
The stable roommates problem with ties

Journal of Algorithms
Refined Inequalities for Stable Marriage

Constraints
A Constraint Programming Approach to the Stable Marriage Problem

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

A Constraint Programming Approach to the Hospitals / Residents Problem

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.