GRASP and path-relinking for Coalition Structure Generation

Details GRASP and path-relinking for Coalition Structure Generation GRASP and path-relinking for Coalition Structure Generation

2011-03-06

arxiv.org/abs/1103.1157v2

Computer Science

Artificial Intelligence

Scientific paper

In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a social welfare, of a set of entities involved in a system into exhaustive and disjoint coalitions. The solution of the CSG problem finds applications in many fields such as Machine Learning (covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation), Semantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition structure is NP-complete. In this paper we present a greedy adaptive search procedure (GRASP) with path-relinking to efficiently search the space of coalition structures. Experiments and comparisons to other algorithms prove the validity of the proposed method in solving this hard combinatorial problem.

Affiliated with

Also associated with

No associations

Rating

GRASP and path-relinking for Coalition Structure Generation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GRASP and path-relinking for Coalition Structure Generation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GRASP and path-relinking for Coalition Structure Generation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418999