Developing resilient algorithms for dynamic coalition formation
| Project/Area Number |
15K16058
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Saga University (2016)
Kyushu University (2015) |
|---|
Principal Investigator |
Ueda Suguru 佐賀大学, 工学(系)研究科(研究院), 助教 (40733762)
|
|---|
| Project Period (FY) |
2015-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2016: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | マッチング理論 / メカニズムデザイン / 協力ゲーム理論 |
|---|
| Outline of Final Research Achievements |
The aim of this research project is to develop coalition formation algorithms for dynamic environment. The main focus is the matching theory, which studies how to "match" two agents/players from two different groups (e.g. man/woman, student/school, residency/hospital) and is one of the important coalition formation problem.
As the outcomes of this research project, two new matching algorithms (mechanisms) were developed. These mechanisms can be used to re-matching problems when the environment changes. One algorithm is based on the deferred acceptance mechanism, which satisfies stability of obtained allocations. The other algorithm is based on the top trading cycles mechanism, which considers efficiency of of obtained allocations.
|
Report
(3 results)
Research Products
(4 results)
