Improved WPM encoding for coalition structure generation under MC-nets
The Coalition Structure Generation (CSG) problem plays an important role in the domain of coalition games. Its goal is to create coalitions of agents so that the global welfare is maximized. To date, Weighted Partial MaxSAT (WPM) encoding has shown high efficiency in solving the CSG problem, which encodes a set of constraints into Boolean propositional logic and employs an off-the-shelf WPM solver to find out the optimal solution. However, in existing WPM encodings, a number of redundant encodings are asserted. This results in additional calculations and correspondingly incurs performance penalty. Against this background, this paper presents an Improved Rule Relation-based WPM (I-RWPM) encoding for the CSG problem, which is expressed by a set of weighted rules in a concise representation scheme called Marginal Contribution net (MC-net). In order to effectively reduce the constraints imposed on encodings, we first identify a subset of rules in an MC-net, referred as a set of freelance rules. We prove that solving the problem made up of all freelance rules can be achieved with a straightforward means without any extra encodings. Thus the set of rules requiring to be encoded is downsized. Next, we improve the encoding of transitive relations among rules. To be specific, compared with the existing rule relation-based encoding that generates transitive relations universally among all rules, I-RWPM only considers the transitivity among rules with particular relationship. In this way, the number of constraints to be encoded can be further decreased. Experiments suggest that I-RWPM significantly outperforms other WPM encodings for solving the same set of problem instances.
KeywordsWeighted partial MaxSAT Coalition structure generation Coalition games
This work is partially supported by the National Natural Science Foundation of China (Grant Number 61806171), Ministry of Education in China Project of Humanities and Social Sciences (Grant Number 17YJCZH260), JSPS KAKENHI (Grant Numbers JP16K00304, JP17K00307, JP17H00761 and JP18H03299).
- 1.Alviano, M., Dodaro, C., Ricca, F. (2015). A maxsat algorithm using cardinality constraints of bounded size. In IJCAI (pp. 2677–2683).Google Scholar
- 2.Argelich, J., Li, C.M., Many, F., Planes, J. (2016). Max-sat 2016: Eleventh max-sat evaluation. http://maxsat.ia.udl.cat/introduction/.
- 6.Cook, S.A. (1971). The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing (pp. 151–158). New York : ACM.Google Scholar
- 7.Cruz, F., Espinosa, A., Moure, J.C., Cerquides, J., Rodriguez-Aguilar, J.A., Svensson, K., Ramchurn, S.D. (2017). Coalition structure generation problems: optimization and parallelization of the idp algorithm in multicore systems. Concurrency and Computation: Practice and Experience, 29(5), 1–20.CrossRefGoogle Scholar
- 8.Davies, J., & Bacchus, F. (2013). Exploiting the power of mip solvers in maxsat. In International conference on theory and applications of satisfiability testing (pp. 166–181). Berlin: Springer.Google Scholar
- 11.Hussin, A., & Fatima, S. (2016). Heuristic methods for optimal coalition structure generation. In Multi-agent systems and agreement technologies (pp. 124–139). Berlin: Springer.Google Scholar
- 12.Ieong, S., & Shoham, Y. (2005). Marginal contribution nets: a compact representation scheme for coalitional games. In Proceedings of the 6th ACM conference on electronic commerce (pp. 193–202). New York: ACM.Google Scholar
- 14.Le Berre, D., & Parrain, A. (2010). The sat4j library, release 2.2, system description. Journal on Satisfiability, Boolean Modeling and Computation, 7, 59–64.Google Scholar
- 16.Li, C.M., & Manyà, F. (2009). Maxsat, hard and soft constraints. Frontiers in Artificial Intelligence & Applications, 185(1), 613–631.Google Scholar
- 17.Liao, X., Koshimura, M., Fujita, H., Hasegawa, R. (2012). Solving the coalition structure generation problem with maxsat. In 2012 IEEE 24th international conference on Tools with artificial intelligence (ICTAI), (Vol. 1 pp. 910–915). Piscataway: IEEE.Google Scholar
- 21.Michalak, T., Marciniak, D., Szamotulski, M., Rahwan, T., Wooldridge, M., McBurney, P., Jennings, N.R. (2010). A logic-based representation for coalitional games with externalities. In Proceedings of the 9th international conference on autonomous agents and multiagent systems: volume 1-Volume 1, International Foundation for Autonomous Agents and Multiagent Systems (pp. 125–132).Google Scholar
- 24.Ohta, N., Conitzer, V., Ichimura, R., Sakurai, Y., Iwasaki, A., Yokoo, M. (2009). Coalition structure generation utilizing compact characteristic function representations. In International Conference on Principles and Practice of Constraint Programming (pp. 623–638). Berlin: Springer.Google Scholar
- 25.Rahwan, T., & Jennings, N.R. (1417). An improved dynamic programming algorithm for coalition structure generation. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3, International Foundation for Autonomous Agents and Multiagent Systems.Google Scholar
- 26.Rahwan, T., Michalak, T.P., Elkind, E., Faliszewski, P., Sroka, J., Wooldridge, M., Jennings, N.R. (2011). Constrained coalition formation. In AAAI, (Vol. 11 pp. 719–725).Google Scholar
- 27.Rahwan, T., Michalak, T.P., Jennings, N.R. (2012). A hybrid algorithm for coalition structure generation. In AAAI (pp. 1443–1449).Google Scholar
- 29.Saikko, P., Berg, J., Järvisalo, M. (2016). Lmhs: a sat-ip hybrid maxsat solver. In International conference on theory and applications of satisfiability testing (pp. 539–546). Berlin: Springer.Google Scholar
- 30.Saikko, P., Wallner, J.P., Järvisalo, M. (2016). Implicit hitting set algorithms for reasoning beyond np. In KR (pp. 104–113).Google Scholar
- 33.Skibski, O., Michalewski, H., Nagórko, A., Michalak, T.P., Dowell, A.J., Rahwan, T., Wooldridge, M. (2016). Non-utilitarian coalition structure generation. In ECAI (pp. 1738–1739).Google Scholar
- 34.Ueda, S., Hasegawa, T., Hashimoto, N., Ohta, N., Iwasaki, A., Yokoo, M. (2012). Handling negative value rules in mc-net-based coalition structure generation. In Proceedings of the 11th international conference on autonomous agents and multiagent systems-Volume 2, International Foundation for Autonomous Agents and Multiagent Systems (pp. 795–804).Google Scholar
- 35.Ueda, S., Iwasaki, A., Conitzer, V., Ohta, N., Sakurai, Y., Yokoo, M. (2018). Coalition structure generation in cooperative games with compact representations. Autonomous Agents and Multi-Agent Systems. https://doi.org/10.1007/s10458-018-9386-z.
- 36.Yang, G., Esmailpour, A., Cao, Y., Nasser, N. (2016). A novel coalitional structure generation algorithm for interference mitigation in small cell networks. In Global communications conference (GLOBECOM), 2016 IEEE (pp. 1–4). Piscataway: IEEE.Google Scholar