| Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
In this research, we considered advanced stable matching problems, such as the Pareto stable matching problem, a matching problem with lower quotas, the popular matching problem.
Our contribution can be summarized as follows. (1) For the Pareto stable matching problem, we proposed a new approach that is different from the algorithm of Chen. Our algorithm can be regarded as an extension of the algorithm Gale and Shapley for the stable matching problem. (2) For a matching problem with lower quotas, we proved that the mechanism proposed by Monte and Tumennasan can be extended to a more general setting. (3) For the popular matching problem, we introduced a matroid generalization of the popular matching problem, and proved that if there exists no tie in preference lists, then we can solve this problem in polynomial time by extending the algorithm of Abraham et al. for the popular matching problem.
|
