On the Complexity and Algorithms of Coalition Structure Generation in Overlapping Coalition Formation Games
ICTAI), 2012 IEEE 24th International Conference（2012）
摘要
The issues of coalition formation have been investigated from many aspects and recently more and more attention has been paid to overlapping coalition formation. The (optimal) coalition structure generation(CSG) problem is one of the essential problems in coalition formation which is an important topic of cooperation in multiagent system. In this paper, we strictly define the coalition structure generation problem of overlapping extensions. Based on these definitions, we systematically prove some computational complexity results for overlapping coalition formation(OCF) games and threshold task games(TTGs). Moreover, dynamic programming and greedy approaches are adopted to solve the CSG for TTG.
更多查看译文
关键词
algorithms,coalition structure generation problem,greedy approaches,ttg,computational complexity,optimal coalition structure generation problem,coalition formation,threshold task games,greedy approach,overlapping coalition formation games,multi-agent systems,coalition structure generation,essential problem,multiagent system,game theory,multi-agent system,important topic,ocf games,greedy algorithms,overlapping extension,overlapping coalition formation,dynamic programming,csg,computational complexity result,ocf-games,multi agent systems,multi agent system
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要