Journal article icon

Journal article

A hybrid exact algorithm for complete set partitioning.

Abstract:

In the Complete Set Partitioning problem we are given a finite set of elements where every subset is associated with a value, and the goal is to partition this set into disjoint subsets so as to maximise the sum of subset values. This abstract problem captures the Coalition Structure Generation problem in cooperative games in characteristic function form, where each subset, or coalition, of agents can make a profit when working together, and the goal is to partition the set of agents into ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Jennings, NR More by this author
More from this funder
Funding agency for:
Michalak, TP
More from this funder
Funding agency for:
Wooldridge, M
Publisher:
Elsevier Publisher's website
Journal:
Artificial Intelligence Journal website
Volume:
230
Pages:
14-50
Publication date:
2016
DOI:
ISSN:
0004-3702
URN:
uuid:81b6a1e7-5499-4938-86cd-c500ab0453ed
Source identifiers:
576721
Local pid:
pubs:576721

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP