A GENERALIZATION OF THE STABLE MATCHING PROBLEM
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
102 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
87 | en_US |
dc.citation.volume |
59 | en_US |
dc.citation.woscount |
8 | |
dc.contributor.author |
TAN, JJM | en_US |
dc.contributor.author |
HSUEH, YC | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:03:26Z | |
dc.date.available |
2014-12-08T15:03:26Z | |
dc.date.issued |
1995-04-21 | en_US |
dc.description.abstract |
It 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.identifier.issn |
0166-218X | en_US |
dc.identifier.journal |
DISCRETE APPLIED MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/1977 | |
dc.identifier.wosnumber |
WOS:A1995QV73800008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
STABLE ROOMMATES PROBLEM | en_US |
dc.subject |
STABLE MATCHING STABLE PARTITION | en_US |
dc.subject |
ALGORITHM | en_US |
dc.title |
A GENERALIZATION OF THE STABLE MATCHING PROBLEM | en_US |
dc.type |
Article | en_US |
檔案
- A1995QV73800008.pdf (1.04 MB, Adobe PDF)
所屬典藏: 期刊論文