2011 Fiscal Year Final Research Report
Research on Formalization and Algorithms for the Stable Matching Problems Adapted to Real World
| Project/Area Number |
20700009
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
MIYAZAKI Shuichi 京都大学, 学術情報メディアセンター, 准教授 (00303884)
|
|---|
| Project Period (FY) |
2008 – 2011
|
| Keywords | アルゴリズム / 組み合わせ問題 / 最適化問題 / 近似アルゴリズム / 安定マッチング / 研修医配属 / 近似困難性 |
|---|
| Research Abstract |
In the stable matching problem, each person submits a list that orders members of the opposite gender based on his/her preference. The task is to find a matching with property called the stability. This problem can be applied to many real-world assignment problem, such as assigning residents to hospitals. In this research, we proposed several variants of this problem to adapt it to each occasion. We also proposed efficient algorithms for them, as well as proved some intractability and inapproximability.
|
