An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists

@inproceedings{Gent2002AnES,
  title={An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists},
  author={Ian P. Gent and Patrick Prosser},
  booktitle={ECAI},
  year={2002}
}
We present the first complete algorithm for the SMTI problem, the stable marriage problem with ties and incomple te lists. We do this in the form of a constraint programming encoding of the problem. With this we are able to carry out the first empirical study of the complete solution of SMTI instances. In the stable mar riage problem (SM) [?] we haven men andn women. Each man ranks the n women, giving himself a preference list. Similarly each wom an ranks the men, giving herself a preference… CONTINUE READING
37 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…