The University of Southampton
University of Southampton Institutional Repository

Coalition structure generation over graphs

Voice, Thomas, Polukarov, Maria and Jennings, Nicholas R. (2012) Coalition structure generation over graphs Journal of Artificial Intelligence Research, 45, pp. 165-196. (doi:10.1613/jair.3715).

Record type: Article

Abstract

We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) ? R over the subsets of nodes, the problem is to find a partition of N into connected subsets, that maximises the sum of the components values. This problem is generally NP complete; in particular, it is hard for a defined class of valuation functions which are independent of disconnected members that is, two nodes have no effect on each others marginal con- tribution to their vertex separator. Nonetheless, for all such functions we provide bounds on the complexity of coalition structure generation over general and minor free graphs. Our proof is constructive and yields algorithms for solving corresponding instances of the problem. Furthermore, we derive linear time bounds for graphs of bounded treewidth. However, as we show, the problem remains NP complete for planar graphs, and hence, for any K_k minor free graphs where k ? 5. Moreover, a 3-SAT problem with m clauses can be represented by a coalition structure generation problem over a planar graph with O(m^2) nodes. Importantly, our hardness result holds for a particular subclass of valuation functions, termed edge sum, where the value of each subset of nodes is simply determined by the sum of given weights of the edges in the induced subgraph.

PDF voice12a.pdf - Author's Original
Download (474kB)
PDF live-3715-6552-jair.pdf - Version of Record
Restricted to Repository staff only
Download (474kB)

More information

Published date: 2012
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 342780
URI: http://eprints.soton.ac.uk/id/eprint/342780
PURE UUID: db106c33-0560-4842-9ffc-e414855cc26d

Catalogue record

Date deposited: 13 Sep 2012 11:31
Last modified: 24 Jul 2017 16:40

Export record

Altmetrics

Contributors

Author: Thomas Voice
Author: Maria Polukarov
Author: Nicholas R. Jennings

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×