Proposing compact representations for coalitional games

2014 Fiscal Year Final Research Report

• 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
• 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).

Free Research Field

人工知能