Access count of this item: 559

Files in This Item:
File Description SizeFormat 
ICKS.2008.7.pdf57.81 kBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIwama, Kazuo
dc.contributor.authorMiyazaki, Shuichi
dc.contributor.alternative岩間, 一雄
dc.contributor.alternative宮崎, 修一
dc.description.abstractThe stable marriage problem is to find a matching between men and women, considering preference lists in which each person expresses his/her preference over the members of the opposite gender. The output matching must be stable, which intuitively means that there is no man- woman pair both of which have incentive to elope. This problem was introduced in 1962 in the seminal paper of Gale and Shapley, and has attracted researchers in several areas, including mathematics, economics, game theory, computer science, etc. This paper introduces old and recent results on the stable marriage problem and some other related problems.
dc.rights© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.rightsThis is not the published version. Please cite only the published version. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。
dc.titleA Survey of the Stable Marriage Problem and Its Variants
dc.type.niitypeJournal Article
dc.identifier.jtitleInformatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. International Conference on
dc.addressGraduate School of Informatics, Kyoto University
dc.addressAcademic Center for Computing and Media Studies, Kyoto University
Appears in Collections:Journal Articles

Show simple item record

Export to RefWorks

Export Format: 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.