1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorTAN, JJMen_US
dc.contributor.authorHSUEH, YCen_US
dc.date.accessioned2014-12-08T15:03:26Z-
dc.date.available2014-12-08T15:03:26Z-
dc.date.issued1995-04-21en_US
dc.identifier.issn0166-218Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/1977-
dc.description.abstractIt is known that there may not exist any stable matching for a given instance of the stable roommates problem. A stable partition is a structure that generalizes the notion of a stable matching; Tan (1991) proved that every instance of the stable roommates problem contains at least one such structure. In this paper we propose a new algorithm for finding a stable partition, and hence a new algorithm for finding a stable matching if one exists. Our algorithm processes the problem dynamically as long as certain relative preference orders are maintained. Some theoretical results about stable partitions are also presented.en_US
dc.language.isoen_USen_US
dc.subjectSTABLE ROOMMATES PROBLEMen_US
dc.subjectSTABLE MATCHING STABLE PARTITIONen_US
dc.subjectALGORITHMen_US
dc.titleA GENERALIZATION OF THE STABLE MATCHING PROBLEMen_US
dc.typeArticleen_US
dc.identifier.journalDISCRETE APPLIED MATHEMATICSen_US
dc.citation.volume59en_US
dc.citation.issue1en_US
dc.citation.spage87en_US
dc.citation.epage102en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1995QV73800008-
dc.citation.woscount8-
Appears in Collections:Articles


Files in This Item:

  1. A1995QV73800008.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...