博碩士論文 962201019 完整後設資料紀錄

DC 欄位 語言
DC.contributor數學系zh_TW
DC.creator顏志瑜zh_TW
DC.creatorChih-yu Yenen_US
dc.date.accessioned2010-7-21T07:39:07Z
dc.date.available2010-7-21T07:39:07Z
dc.date.issued2010
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=962201019
dc.contributor.department數學系zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract本文主要在於探討穩定配對中的穩定婚姻問題,提及穩定男伴、拆散配對以及P循環的概念,重新推導 Knuth, Motwani 與 Pittel 的結論: 對任何女生的穩定男伴為至少 max(0,(1/2-epsilon)lnn ,最多為 (1+epsilon)lnn 個的機率趨近 1,當n → ∞ 時,其中 0< varepsilon <1 。並介紹兩種方法找到所有的穩定配對,透過 C++ 模擬結果比較各方法的優缺點,並與理論值作比對。 zh_TW
dc.description.abstractIn this paper we study the stable marriage and stable husbands problems of stable matching, using the concept of breakmarriage and p-cycle, and revisit the result of Knuth ,Motwani and, Pittel : any particular girl has at least max(0, (1/2−epsilon) ln n) and at most (1+epsilon) ln n different husbands, with probability approaching 1 as n → ∞, if 0 < epsilin < 1. We introduce two methods to find all stable matchings and simulate in C++ programming language to compare these two methods and theoretical results. en_US
DC.subject穩定婚姻zh_TW
DC.subject穩定配偶zh_TW
DC.subjectstable marriageen_US
DC.subjectstable pairsen_US
DC.title穩定婚姻及穩定配偶的模擬zh_TW
dc.language.isozh-TWzh-TW
DC.titleThe Simulation of Stable Marriage and Stable Pairsen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明