Some optimizations in maximal clique based distributed coalition formation for collaborative multi-agent systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study scalable and efficient coordination and negotiation protocols for collaborative multi-agent systems (MAS). The coordination problem we address is multi-agent coalition formation in a fully decentralized, resource-bounded setting. More specifically, we design, analyze, optimize and experiment with the Maximal Clique based Distributed Coalition Formation (MCDCF) algorithm. We briefly describe several recent improvements and optimizations to the original MCDCF protocol and summarize our simulation results and their interpretations. We argue that our algorithm is a rare example in the MAS research literature of an efficient and highly scalable negotiation protocol applicable to several dozens or even hundreds (as opposed to usually only a handful) of collaborating autonomous agents. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Tošić, P. T., & Ginne, N. K. R. (2010). Some optimizations in maximal clique based distributed coalition formation for collaborative multi-agent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6335 LNCS, pp. 353–360). https://doi.org/10.1007/978-3-642-15470-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free