Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUO, RTen_US
dc.contributor.authorTSENG, SSen_US
dc.date.accessioned2014-12-08T15:05:40Z-
dc.date.available2014-12-08T15:05:40Z-
dc.date.issued1990en_US
dc.identifier.issn0006-3835en_US
dc.identifier.urihttp://hdl.handle.net/11536/4209-
dc.identifier.urihttp://dx.doi.org/10.1007/BF01933208en_US
dc.description.abstractThe stable matching problem is that of matching two sets of agents in such a manner that no two unmatched agents prefer each other to their actual partners under the matching. In this paper, we present a set of sufficient conditions on the preference lists of any given stable matching instance, under which the optimality of the original male optimal stable matching is still preserved.en_US
dc.language.isoen_USen_US
dc.subjectSTABLE MATCHING PROBLEMen_US
dc.subjectASSIGNMENTen_US
dc.subjectPREFERENCEen_US
dc.subjectINVARIANCEen_US
dc.titleON THE INVARIANCE OF MALE OPTIMAL STABLE MATCHINGen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/BF01933208en_US
dc.identifier.journalBITen_US
dc.citation.volume30en_US
dc.citation.issue4en_US
dc.citation.spage592en_US
dc.citation.epage598en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1990EX83000003-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. A1990EX83000003.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.