MaxSAT encoding for MC-net-based coalition structure generation problem with externalities

Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1781-1789
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE97-D
Issue number7
DOIs
Publication statusPublished - Jul 2014

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

MaxSAT encoding for MC-net-based coalition structure generation problem with externalities. / Liao, Xiaojuan; Koshimura, Miyuki; Fujita, Hiroshi; Hasegawa, Ryuzo.

In: IEICE Transactions on Information and Systems, Vol. E97-D, No. 7, 07.2014, p. 1781-1789.

Research output: Contribution to journalArticle

@article{b5ab2ef192574a5987a4e67809786332,
title = "MaxSAT encoding for MC-net-based coalition structure generation problem with externalities",
abstract = "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.",
author = "Xiaojuan Liao and Miyuki Koshimura and Hiroshi Fujita and Ryuzo Hasegawa",
year = "2014",
month = "7",
doi = "10.1587/transinf.E97.D.1781",
language = "English",
volume = "E97-D",
pages = "1781--1789",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "7",

}

TY - JOUR

T1 - MaxSAT encoding for MC-net-based coalition structure generation problem with externalities

AU - Liao, Xiaojuan

AU - Koshimura, Miyuki

AU - Fujita, Hiroshi

AU - Hasegawa, Ryuzo

PY - 2014/7

Y1 - 2014/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84903715060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903715060&partnerID=8YFLogxK

U2 - 10.1587/transinf.E97.D.1781

DO - 10.1587/transinf.E97.D.1781

M3 - Article

AN - SCOPUS:84903715060

VL - E97-D

SP - 1781

EP - 1789

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 7

ER -