| Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
The stable matching problem is a problem of finding a matching having a property called the "stability". It is widely used in several centralized matching systems, such as hospitals-residents matching, college admission, and laboratory assignment. In this research, we considered several models of stable matching problem with practical conditions, and developed algorithms, showed approximability, and proved intractability for each such model. The models include the student-project allocation problem, the stable marriage problem with ties and incomplete preference lists, and the hospitals/residents problem with lower quotas.
|
