AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

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

FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS, (2002): 141-145

Cited: 57|Views21

Full Text

Other Links

dblp.uni-trier.de academic.microsoft.com

Bibtex

Keywords

stable matchingstable marriage problemconstraint programmingpolynomial timeempirical study

Abstract

We present the first complete algorithm for the SMTI problem, the stable marriage problem with ties and incomplete 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 marriage problem (SM) [...More

Code:

Data:

Full Text

PPT (Upload PPT)

Similar

Reference

Cited

Author

Ian P. Gent

[0]

Patrick Prosser

[0]

Your rating :

No Ratings