Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Computationally Manageable Combinational Auctions
Management Science
Coalition structure generation with worst case guarantees
Artificial Intelligence
Introduction to Algorithms
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
A survey of multi-agent organizational paradigms
The Knowledge Engineering Review
Coalition formation mechanism in multi-agent systems based on genetic algorithms
Applied Soft Computing
Task allocation via coalition formation among autonomous agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Methods for task allocation via agent coalition formation
Artificial Intelligence
| Hi-index | 0.00 |
The paper presents a novel method for Coalition Formation Problem (CFP). The main requirements of the method are: the acceptable solution should be achieved in the constrained, acceptable time; the solution should be obtained with a worst case guarantees. The Sandholm Algorithm (SanA) can give the optimal solution, but it requires unacceptable time. On the other hand, heuristic approach, e.g., Evolutionary Algorithm (EA), can be able to give a quite good solution, but we do not know how far it is from the optimum. We propose a hybrid approach (SanEv) in which firstly, the Sandholm Algorithm is ran to achieve a solution on a given quality level, next we run an Evolutionary Algorithm. The paper presents our method and performed experiments.