ON THE INVARIANCE OF MALE OPTIMAL STABLE MATCHING

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	KUO, RT	en_US
dc.contributor.author	TSENG, SS	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.identifier.issn	0006-3835	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4209	-
dc.identifier.uri	http://dx.doi.org/10.1007/BF01933208	en_US
dc.description.abstract	The 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.iso	en_US	en_US
dc.subject	STABLE MATCHING PROBLEM	en_US
dc.subject	ASSIGNMENT	en_US
dc.subject	PREFERENCE	en_US
dc.subject	INVARIANCE	en_US
dc.title	ON THE INVARIANCE OF MALE OPTIMAL STABLE MATCHING	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/BF01933208	en_US
dc.identifier.journal	BIT	en_US
dc.citation.volume	30	en_US
dc.citation.issue	4	en_US
dc.citation.spage	592	en_US
dc.citation.epage	598	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:A1990EX83000003	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。