An n-ary Constraint for the Stable Marriage Problem

08/01/2013
by   Chris Unsworth, et al.
0

We present an n-ary constraint for the stable marriage problem. This constraint acts between two sets 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 n women we require only one of these constraints, and the complexity of enforcing arc-consistency is O(n^2) which is optimal in the size of input. Our computational studies show that our n-ary constraint is significantly faster and more space efficient than the encodings presented in cp01. We also introduce a new problem to the constraint community, the sex-equal stable marriage problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2011

The AllDifferent Constraint with Precedences

We propose AllDiffPrecedence, a new global constraint that combines toge...
research
05/26/2019

An Unconditionally Stable First-Order Constraint Solver for Multibody Systems

This article describes an absolutely stable, first-order constraint solv...
research
05/22/2009

Multiset Ordering Constraints

We identify a new and important global (or non-binary) constraint. This ...
research
11/28/2016

The BIN_COUNTS Constraint: Filtering and Applications

We introduce the BIN_COUNTS constraint, which deals with the problem of ...
research
06/08/2015

NP-hardness of sortedness constraints

In Constraint Programming, global constraints allow to model and solve m...
research
02/04/2014

Short and Long Supports for Constraint Propagation

Special-purpose constraint propagation algorithms frequently make implic...
research
12/17/2017

Microbial community structure predicted by the stable marriage problem

Experimental studies of microbial communities routinely reveal several s...

Please sign up or login with your details

Forgot password? Click here to reset