A Branch and Bound Algorithm for Coalition Structure Generation over Graphs

04/28/2020
by   Emanuel Florentin Olariu, et al.
0

We give a column generation based branch and bound algorithm for coalition structure generation over graphs problem using valuation functions for which this problem is proven to be NP-complete. For a given graph G = (V;E) and a valuation function w : 2^V -> R, the problem is to find the most valuable coalition structure (or partition) of V. We consider two cases: first when the value of a coalition is the sum of the weights of its edges which can be positive or negative, second when the value of a coalition takes account of both inter- and intra-coalitional disagreements and agreements, respectively. For both valuations we give experimental results which cover for the first time sets of more than forty agents. For another valuation function (coordination) we give only the theoretical considerations in the appendix.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2011

Graph Coalition Structure Generation

We give the first analysis of the computational complexity of coalition...
research
08/28/2019

The Tessellation Cover Number of Good Tessellable Graphs

A tessellation of a graph is a partition of its vertices into vertex dis...
research
06/04/2020

On subset sum problem in branch groups

We consider a group-theoretic analogue of the classic subset sum problem...
research
01/27/2023

Decompositions into two linear forests of bounded lengths

For some k ∈ℤ_≥ 0∪∞, we call a linear forest k-bounded if each of its co...
research
05/27/2013

Improved Branch-and-Bound for Low Autocorrelation Binary Sequences

The Low Autocorrelation Binary Sequence problem has applications in tele...
research
11/10/2020

Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs

In order to study real-world systems, many applied works model them thro...
research
10/19/2012

Inference in Polytrees with Sets of Probabilities

Inferences in directed acyclic graphs associated with probability sets a...

Please sign up or login with your details

Forgot password? Click here to reset