MaxSAT Encoding for MC-Net-Based Coalition Structure Generation Problem with Externalities

Xiaojuan LIAO  Miyuki KOSHIMURA  Hiroshi FUJITA  Ryuzo HASEGAWA  

IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.7   pp.1781-1789
Publication Date: 2014/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E97.D.1781
Type of Manuscript: PAPER
Category: Information Network
coalition structure generation,  externality,  weighted partial MaxSAT,  cooperative games,  

Full Text: PDF>>
Buy this Article

Coalition Structure Generation (CSG) is a main research issue in the domain of coalition games. A majority of existing works assume that the value of a coalition is independent of others in the coalition structure. Recently, there has been interest in a more realistic settings, where the value of a coalition is affected by the formation of other coalitions. This effect is known as externality. The focus of this paper is to make use of Maximum Satisfiability (MaxSAT) to solve the CSG problem where externalities may exist. In order to reduce the exponentially growing number of possible solutions in the CSG problem, we follow the previous works by representing the CSG problem as sets of rules in MC-nets (without externalities) and embedded MC-nets (with externalities). Specifically, enlightened by the previous MC-net-based algorithms exploiting the constraints among rule relations to solve the CSG problem, we encode such constraints into weighted partial MaxSAT (WPM) formulas. Experimental results demonstrate that an off-the-shelf MaxSAT solver achieves significant improvements compared to the previous algorithm for the same set of problem instances.