Popular Sets of Matching for Instances with Uniform Permutations of Preferences
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 103 === Popular matching problems have been explored in recent years, as they are highly related to realistic problems that allocate limited resources and taking requesters'' preference in concern. An instance of a popular matching problem consists of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67724501989679041445 |