TY - JOUR
T1 - A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets
AU - Liao, Xiaojuan
AU - Koshimura, Miyuki
N1 - Funding Information:
We thank Prof. Ryuzo Hasegawa, Prof. Hiroshi Fujita, Hiroshi Kihara, Kazuki Nomoto, Prof. Suguru Ueda, Dr. Yuko Sakurai and Prof. Makoto Yokoo for their constructive suggestions and support of our research. This work was supported by the National Natural Science Foundation of China [Grant Number 61806171], JSPS KAKENHI [Grant Numbers JP16K00304, JP17K00307, JP19H04175] and Ministry of Education in China Project of Humanities and Social Sciences [Grant Number 17YJCZH260].
Publisher Copyright:
© 2019 The Author(s).
PY - 2019/9/4
Y1 - 2019/9/4
N2 - Coalition structure generation (CSG) is one of the main research issues in the use of coalitional games in multiagent systems and weighted partial MaxSAT (WPM) encodings, i.e. rule relation-based WPM (RWPM) and agent relation-based WPM (AWPM), which are efficient for solving the CSG problem. Existing studies show that AWPM surpasses RWPM since it achieves more compact encoding; it generates fewer variables and clauses than RWPM. However, in this paper, we focus on a special case in which the two encodings generate identical numbers of variables and clauses. Experiments show that RWPM surprisingly has a dominant advantage over AWPM, which aroused our interest. We exploit the deep-rooted reason and find that it is the redundancy when encoding transitive laws in RWPM that leads to this situation. Finally, we remove redundant clauses for transitive laws in RWPM and develop an improved RWPM with refined transitive laws to solve the CSG problem. Experiments demonstrate that refined encoding is more compact and efficient than previous WPM encodings.
AB - Coalition structure generation (CSG) is one of the main research issues in the use of coalitional games in multiagent systems and weighted partial MaxSAT (WPM) encodings, i.e. rule relation-based WPM (RWPM) and agent relation-based WPM (AWPM), which are efficient for solving the CSG problem. Existing studies show that AWPM surpasses RWPM since it achieves more compact encoding; it generates fewer variables and clauses than RWPM. However, in this paper, we focus on a special case in which the two encodings generate identical numbers of variables and clauses. Experiments show that RWPM surprisingly has a dominant advantage over AWPM, which aroused our interest. We exploit the deep-rooted reason and find that it is the redundancy when encoding transitive laws in RWPM that leads to this situation. Finally, we remove redundant clauses for transitive laws in RWPM and develop an improved RWPM with refined transitive laws to solve the CSG problem. Experiments demonstrate that refined encoding is more compact and efficient than previous WPM encodings.
UR - http://www.scopus.com/inward/record.url?scp=85077757178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077757178&partnerID=8YFLogxK
U2 - 10.1093/logcom/exz017
DO - 10.1093/logcom/exz017
M3 - Article
AN - SCOPUS:85077757178
VL - 29
SP - 913
EP - 931
JO - Journal of Logic and Computation
JF - Journal of Logic and Computation
SN - 0955-792X
IS - 6
ER -