| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 顏志瑜 | zh_TW |
| DC.creator | Chih-yu Yen | en_US |
| dc.date.accessioned | 2010-7-21T07:39:07Z | |
| dc.date.available | 2010-7-21T07:39:07Z | |
| dc.date.issued | 2010 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=962201019 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_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.abstract | In 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.subject | stable marriage | en_US |
| DC.subject | stable pairs | en_US |
| DC.title | 穩定婚姻及穩定配偶的模擬 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | The Simulation of Stable Marriage and Stable Pairs | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |