Integer and combinatorial optimization
Integer and combinatorial optimization
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Coalition, cryptography, and stability: mechanisms for coalition formation in task oriented domains
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Negotiation and cooperation in multi-agent environments
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Computationally Manageable Combinational Auctions
Management Science
Coalition structure generation with worst case guarantees
Artificial Intelligence
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Cliques and clustering: A combinatorial approach
Operations Research Letters
Searching for overlapping coalitions in multiple virtual organizations
Information Sciences: an International Journal
Negotiation policies and coalition tools in e-marketplace environment
Computers and Industrial Engineering
A revision algorithm for invalid encodings in concurrent formation of overlapping coalitions
Applied Soft Computing
| Hi-index | 0.01 |
The goal of this paper is to provide a computational study of the coalition formation problem in multi-agent systems. The coalition formation problem, as formulated here, is based on social welfare maximizing criteria, which aims to increase the total value of coalition structures in a multi-agent system. Value of each coalition depends only on the participating members. Pairwise relationships of coalition members determine the value of a coalition.In this study, the problem is formulated as a set partitioning problem and a column generation approach is proposed to solve it. Assuming that the coalition forming agents have computational capabilities, the algorithm is also extended to a parallel algorithm where all agents share the computational burden of coming up with a coalition. The proposed algorithms are implemented and tested in three types of environments, where expected pairwise relationship values are positive, zero or negative. Based on the test results, we highlight the coalition environments where parallel column generation technique is viable.