Proposing compact representations for coalitional games
Project/Area Number |
23500166
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Intelligent informatics
|
Research Institution | Kyushu University |
Principal Investigator |
SAKURAI Yuko 九州大学, システム情報科学研究科(研究院, 准教授 (10396137)
|
Co-Investigator(Kenkyū-buntansha) |
MAKOTO Yokoo 九州大学, システム情報科学研究院, 教授 (20380678)
|
Co-Investigator(Renkei-kenkyūsha) |
MINATO Shin-ichi 北海道大学, 情報科学研究科, 教授 (10374612)
|
Project Period (FY) |
2011-04-28 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2011: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
Keywords | マルチエージェントシステム / 協力ゲーム / 提携構造形成問題 / 二分決定グラフ / 特性関数 / 簡潔記述法 / 人工知能 / ゲーム理論 / 情報ネットワーク経済 / ゼロサプレス型二分決定グラフ |
Outline of Final Research Achievements |
Coalitional games, including Coalition Structure Generation (CSG),have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. Previous studies have found that many problems in coalitional games tend to be computationally intractable in this black-box function representation. We proposed a new concise representation scheme for a characteristic function based on a Zero-suppressed Binary Decision Diagram (ZDD). We received the best paper award at the 4th International Conference on Principles and Practice of Multi- Agent System (PRIMA 2011).
|
Report
(5 results)
Research Products
(23 results)