Solving Coalition Structure Generation Problems over Weighted Graph

Emi Watanabe, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Coalition Structure Generation (CSG), which is a leading research issue in the domain of coalitional games, divides agents into exhaustive and disjoint coalitions to optimize social welfare. This paper studies CSG problems over weighted undirected graphs in which the weight on an edge between any two connecting agents represents how well they work together in a coalition. The weight can have either a positive or a negative value. We examine two types of problems. One is a CSG without any restrictions on the number of coalitions, and another is a CSG with k coalitions where k is determined in advance. We present two methods to solve these problems: ILP formulation and MaxSAT encoding.

Original languageEnglish
Title of host publicationPRIMA 2019
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings
EditorsMatteo Baldoni, Mehdi Dastani, Beishui Liao, Yuko Sakurai, Rym Zalila Wenkstern
PublisherSpringer
Pages338-353
Number of pages16
ISBN (Print)9783030337919
DOIs
Publication statusPublished - 2019
Event22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019 - Turin, Italy
Duration: Oct 28 2019Oct 31 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11873 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019
Country/TerritoryItaly
CityTurin
Period10/28/1910/31/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Solving Coalition Structure Generation Problems over Weighted Graph'. Together they form a unique fingerprint.

Cite this