On the Complexity and Algorithms of Coalition Structure Generation in Overlapping Coalition Formation Games

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.