A study of stable matching
博士 === 國立交通大學 === 資訊科學研究所 === 78 === The stable matching problem was introduced by Gale and Shapley in 1962. That is the problem of matching two sets of agents in such a manner that no two unmatched agents prefer each other to their partners. This dissertation is a s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1990
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98050401557788505926 |