學術產出-學位論文
文章檢視/開啟
書目匯出
-
題名 穩定狀態下室友問題延伸之研究
Extension of stable roommates problem作者 姚瞻海
YAO, ZHAN-HAI貢獻者 李子壩
姚瞻海
YAO, ZHAN-HAI日期 1992
1991上傳時間 2-五月-2016 15:17:45 (UTC+8) 參考文獻 [1] A.Alkan,"Nonexistence of stable threesome matchings", Mathematical Social Sciences, 16:207-209,1988. [2] L.E. Dubins and D. Freedman," Machiavelli and the Gale-Shapley algorithm", American Mathematical Monthly, 88 : 485-494, 1981. [3] D. Gale and L.S. Shapley, "College admissions and the stability of marriage", American Mathematical M onthly,69:9-15,1962. [4] D. Gusfield, "The structure of the stable room-mates problem: effcient representation and enumeration of all stable assignments" ,SIMA Journal on Computing ,17: 742-769,1988. [5]D. Gusfield and R.W. Ivring, "The stable marriage problem: structure and algorithms" ,MIT press,Cambridge,1989. [6] R.W. Irving," An efficient algorithm for the stable room-mates problem", Journal of Algorithms,6: 577-595,1985. [7] D. McVitie and L.B. Wilson, "The stable marriage problem", Communications of the A. C.M.,14: 486-490,1971. [8] A.E. Roth and M. Sotomayor, "Two sided matching: a study in game- theoretic modelling and analysis" ,Book to be published by Cambridge University Press,Econometric Series, 1991. [9]M. Shubik," Game theory in the social sciences concepts and solution" ,MIT Press,Cambridge,1982. [10] J.M. Tan," A necessary and sufficient condition for the existence of a complete stable matching", Journal of Algorithms,12:154-178,1991. [11] T. Quint, "The core of an m-sided assignment game". Games and Economic Behavior,3:487-503,1991. 描述 碩士
國立政治大學
統計學系資料來源 http://thesis.lib.nccu.edu.tw/record/#B2002004658 資料類型 thesis dc.contributor.advisor 李子壩 zh_TW dc.contributor.author (作者) 姚瞻海 zh_TW dc.contributor.author (作者) YAO, ZHAN-HAI en_US dc.creator (作者) 姚瞻海 zh_TW dc.creator (作者) YAO, ZHAN-HAI en_US dc.date (日期) 1992 en_US dc.date (日期) 1991 en_US dc.date.accessioned 2-五月-2016 15:17:45 (UTC+8) - dc.date.available 2-五月-2016 15:17:45 (UTC+8) - dc.date.issued (上傳時間) 2-五月-2016 15:17:45 (UTC+8) - dc.identifier (其他 識別碼) B2002004658 en_US dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/89247 - dc.description (描述) 碩士 zh_TW dc.description (描述) 國立政治大學 zh_TW dc.description (描述) 統計學系 zh_TW dc.description.tableofcontents 第一章 緒論.................... 1 第一節 穩定婚姻問題的基本概念與性質.................... 1 第二節 穩定室友問題的基本概念與性質.................... 6 第三節 研究動機與目的.................... 9 第四節 本文架構.................... 9 第二章 三類別穩定婚姻問題之探討.................... 11 第一節 模型建立.................... 11 第二節 穩定分配之定義.................... 14 第三節 穩定分配與對局的核之關連性.................... 22 第三章 穩定室友問題的存在討論.................... 27 第一節 基本術語與符號....................27 第二節 穩定分割....................30 第三節 穩定完全分配的充分條件.................... 39 第四章 結論....................44 參考文獻....................45 zh_TW dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#B2002004658 en_US dc.title (題名) 穩定狀態下室友問題延伸之研究 zh_TW dc.title (題名) Extension of stable roommates problem en_US dc.type (資料類型) thesis en_US dc.relation.reference (參考文獻) [1] A.Alkan,"Nonexistence of stable threesome matchings", Mathematical Social Sciences, 16:207-209,1988. [2] L.E. Dubins and D. Freedman," Machiavelli and the Gale-Shapley algorithm", American Mathematical Monthly, 88 : 485-494, 1981. [3] D. Gale and L.S. Shapley, "College admissions and the stability of marriage", American Mathematical M onthly,69:9-15,1962. [4] D. Gusfield, "The structure of the stable room-mates problem: effcient representation and enumeration of all stable assignments" ,SIMA Journal on Computing ,17: 742-769,1988. [5]D. Gusfield and R.W. Ivring, "The stable marriage problem: structure and algorithms" ,MIT press,Cambridge,1989. [6] R.W. Irving," An efficient algorithm for the stable room-mates problem", Journal of Algorithms,6: 577-595,1985. [7] D. McVitie and L.B. Wilson, "The stable marriage problem", Communications of the A. C.M.,14: 486-490,1971. [8] A.E. Roth and M. Sotomayor, "Two sided matching: a study in game- theoretic modelling and analysis" ,Book to be published by Cambridge University Press,Econometric Series, 1991. [9]M. Shubik," Game theory in the social sciences concepts and solution" ,MIT Press,Cambridge,1982. [10] J.M. Tan," A necessary and sufficient condition for the existence of a complete stable matching", Journal of Algorithms,12:154-178,1991. [11] T. Quint, "The core of an m-sided assignment game". Games and Economic Behavior,3:487-503,1991. zh_TW
