Coalition Formation for Resource Coallocation Using BDI Assignment Agents

Authors:
Kiam Tian Seow;Kwang Mong Sim;S. Y.C. Kwek
Affiliations:
Nanyang Technol. Univ., Singapore;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Year:
2007

Citing 0
Cited 7

Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies

Information Sciences: an International Journal
Concurrent collective strategy diffusion of multiagents: the spatial model and case study

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews - Special issue on information reuse and integration
Searching for overlapping coalitions in multiple virtual organizations

Information Sciences: an International Journal
A revision algorithm for invalid encodings in concurrent formation of overlapping coalitions

Applied Soft Computing
Locality-sensitive task allocation and load balancing in networked multiagent systems: Talent versus centrality

Journal of Parallel and Distributed Computing
Preference Coalition Formation Scheme for Buyer Coalition Services with Bundles of Items

International Journal of Systems and Service-Oriented Engineering
Preference Coalition Formation Scheme for Buyer Coalition Services with Bundles of Items

International Journal of Systems and Service-Oriented Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new distributed agent algorithm for resource co-allocation to different tasks is proposed. The algorithm extends a belief-desire-intention (BDI) assignment algorithm with resource capability reasoning. It enables resource agents to form coalitions via iterative BDI reasoning and negotiation given the limited capabilities of the resources vis-a-vis task requirements, without directly limiting the coalition size. In the worst case analysis, the number of negotiation rounds required by the algorithm is shown to be of a polynomial order in the number of agents. Empirical evidence from simulations shows that the algorithm yields favorable results in terms of the number of effective coalitions formed for different tasks. Fundamental differences between the proposed algorithm and related work are also discussed.