A MAXIMUM STABLE MATCHING FOR THE ROOMMATES PROBLEM
| dc.citation.epage | 640 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 631 | en_US |
| dc.citation.volume | 30 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | TAN, JJM | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:05:40Z | |
| dc.date.available | 2014-12-08T15:05:40Z | |
| dc.date.issued | 1990 | en_US |
| dc.description.abstract | The stable roommates problem is that of matching n people into n/2 disjoint pairs so that no two persons, who are not paired together, both prefer each other to their respective mates under the matching. Such a matching is called "a complete stable matching". It is known that a complete stable matching may not exist. Irving proposed an O(n2) algorithm that would find one complete stable matching if there is one, or would report that none exists. Since there may not exist any complete stable matching, it is natural to consider the problem of finding a maximum stable matching, i.e., a maximum number of disjoint pairs of persons such that these pairs are stable among themselves. In this paper, we present an O(n2) algorithm, which is a modified version of Irving's algorithm, that finds a maximum stable matching. | en_US |
| dc.identifier.doi | 10.1007/BF01933211 | en_US |
| dc.identifier.issn | 0006-3835 | en_US |
| dc.identifier.journal | BIT | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF01933211 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/4210 | |
| dc.identifier.wosnumber | WOS:A1990EX83000006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | STABLE ROOMMATES PROBLEM | en_US |
| dc.subject | STABLE MATCHING | en_US |
| dc.subject | MAXIMUM STABLE MATCHING | en_US |
| dc.subject | ALGORITHMS | en_US |
| dc.title | A MAXIMUM STABLE MATCHING FOR THE ROOMMATES PROBLEM | en_US |
| dc.type | Article | en_US |