On the Stability of Matching and Its Applications
碩士 === 國立屏東教育大學 === 應用數學系 === 102 === This paper study the stability of matching and its applications, we will use the deferred acceptance algorithm to prove each preferential ranking matrix there exists a stable complete matching. In chapter 2, we introduce bipartite graphs and we give some fundame...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/40670850434780639810 |
| Summary: | 碩士 === 國立屏東教育大學 === 應用數學系 === 102 === This paper study the stability of matching and its applications, we will use the deferred acceptance algorithm to prove each preferential ranking matrix there exists a stable complete matching. In chapter 2, we introduce bipartite graphs and we give some fundamental facts about matching theory in chapter 3. Finally, in chapter 4, we give some examples of applications by using the stability of matching.
|
|---|