Summary
One of the most compelling characteristics of multi agent systems is the ability to form coalitions to share their resources, create plans, share execution of tasks, etc. The work presented in this article offers scalable methods for finding potential coalition partners when not all agents in a large multi-agent system are known to the agents in need of help to achieve their goals. A new algorithm for finding partners in a MAS, based on concepts inspired by peer-to-peer networks, is described. The proposed algorithm design aims to provide a new, completely decentralized scheme that can be used by agents to gather information needed to make decisions about potential partners. The proposed algorithm is competitive with centralized approaches in smaller multi-agent systems and provides better scalability for larger systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. David, J. S. Sichman, and H. Coelho. Extending social reasoning to cope with multiple partner coalitions. In Proceedings of the 9th European Workshop on Modelling Autonomous Agents in a Multi-Agent World (MAAMAW’99), pages 175–187, Valencia, Spain, 1999. Springer.
N. G. de Bruijn. A combinatorial problem. In Koninklijke Nederlandse Akademie van Wetenschappen, pages 758–764, Netherlands, 1946.
H. Dmpfling. Gnutella web caching system, 2003. Last updated: June 18th, 2003, last accessed: August 10th, 2004.
M. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’ 03), Berkeley, CA, 2003.
M. L. Kahn and C. D. T. Cicalese. The coabs grid. In Proceedings of the Goddard/JPL Workshop on Radical Agent Concepts, Tysons Corner, VA, 2002.
X. Li and C. G. Plaxton. On name resolution in peer-to-peer networks. In Proceedings of the International Symposium on Distributed Computing (DISC 2002), Workshop on Principles of Mobile Computing, Toulouse, France, 2002.
C. E. Martin. Representing autonomy in sensible agent-based systems. Master’s thesis, The University of Texas at Austin, 1997.
B. Moulin and B. Chaib-draa. An Overview of Distributed Artificial Intelligence, chapter 1, pages 3–55. John Wiley & Sons, 1996.
E. Ogston and S. Vassiliadis. Local distributed agent matchmaking. In Proceedings of the 9th International Conference on Cooperative Information Systems, pages 67–79, Trento, Italy, 2001.
E. Ogston and S. Vassiliadis. Matchmaking among minimal agents without a facilitator. In Proceedings of the 5th International Conference on Autonomous Agents, pages 608–615, Montral, QC, Canada, 2001.
E. Ogston and S. Vassiliadis. Unstructured agent matchmaking: Experiments in timing and fuzzy matching. In Proceedings of the Languages And Applications Special Track of the 17th ACM Symposium on Applied Computing, pages 300–305, Madrid, Spain, 2002.
L. A. Peterson and B. S. Davie. Computer Networks: A Systems Approach. Morgan Kaufmann, 1999.
C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 311–320, Newport, RI, 1997.
T. W. Sandholm and V. R. Lesser. Coalitions among computationally bounded agents. Artificial Intelligence, 1(94):99–137, 1999.
S. Sen and P. S. Dutta. Searching for optimal coalition structures. In Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000), pages 287–292, Boston, MA, 2000.
O. Shehory and S. Kraus. Task allocation via coalition formation among autonomous agents. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 655–661, Montral, QC, Canada, 1995.
R. G. Smith. The contract net protocol: High-level communication and control in a distributed problem-solver. IEEE Transactions on Computers, pages 1104–1113, 1980.
I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for internet applications. In Proceedings of the ACM SIGCOMM’ 01 Conference, San Diego, CA, 2001.
B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC’ 02), pages 194–205, 2002.
Michael Wooldridge and Nicholas R. Jennings. Intelligent agents: Theory and practice. HTTP://www.doc.mmu.ac.uk/STAFF/mike/ker95/ker95-html.h (Hypertext version of Knowledge Engineering Review paper), 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Vanzin, M.M., Barber, K.S. (2006). Decentralized Partner Finding in Multi-Agent Systems. In: Scerri, P., Vincent, R., Mailler, R. (eds) Coordination of Large-Scale Multiagent Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-27972-5_4
Download citation
DOI: https://doi.org/10.1007/0-387-27972-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-26193-5
Online ISBN: 978-0-387-27972-5
eBook Packages: Computer ScienceComputer Science (R0)