skip to main content
10.1145/545056.545129acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

An improvement to matchmaking algorithms for middle agents

Published: 15 July 2002 Publication History

Abstract

A question frequently asked in multi-agent systems (MASs) concerns the efficient search for suitable agents to solve a specific problem. To answer this question, different types of middle agents are usually employed. The performance of middle agents relies heavily on the matchmaking algorithms used. Matchmaking is the process of finding an appropriate provider for a requester through a middle agent. There has been substantial work on matchmaking in different kinds of middle agents. To our knowledge, almost all currently used matchmaking algorithms missed one point when doing matchmaking -- the matchmaking is only based on the advertised capabilities of provider agents. The actual performance of provider agents in accomplishing delegated tasks is not considered at all. This results in the inaccuracy of the matchmaking outcomes as well as the random selection of provider agents with the same advertised capabilities. The quality of service of different service provider agents varies from one agent to another even though they claimed they have the same capabilities. To this end, it is argued that the practical performance of service provider agents has a significant impact on the matchmaking outcomes of middle agents. An improvement to matchmaking algorithms is proposed, which makes the algorithms have the ability to consider the track records of agents in accomplishing delegated tasks. How to represent, accumulate, and use track records as well as how to give initial values for track records in the algorithm are discussed. A prototype is also built to verify the algorithm. Based on the improved algorithm, the matchmaking outcomes are more accurate and reasonable.

References

[1]
K. Sycara, K. Decker, A. Pannu, M. Williamson, and D. Zeng, Distributed Intelligent Agents, IEEE Expert, 11(6), 1996, 36--46.]]
[2]
D. Martin, A. Cheyer, and D. Moran, The Open Agent Architecture: A Framework for Building Distributed Software Systems, Applied Artificial Intelligence, 13(1--2), 1999, 92--128.]]
[3]
A. Cheyer and D. Martin, The Open Agent Architecture, Autonomous Agents and Multi-Agent Systems, 4(1--2), 2001, 143--148.]]
[4]
V. Subrahmanian, P. Bonatti, J. Dix, et al., Heterogeneous Agent Systems, The MIT Press, 2000.]]
[5]
R. J. Bayardo, W. Bohrer, R. Brice et al., InfoSleuth: Agent-Based Semantic Integration of Information in Open and Dynamic Environments, in: M. N. Huhns and M. P. Singh (Eds.), Readings in Agents, Morgan Kaufmann, CA, 1998, 205--216.]]
[6]
K. Decker, K. Sycara, and M. Williamson, Middle Agents for the Internet, Proceedings of 15th IJCAI, Nogoya, Japan, 1997, 578--583.]]
[7]
M. R. Genesereth and S. P. Ketchpel, Software Agents, Communications of the ACM, 37(7), 1994, 48--53.]]
[8]
Stephen T. Welstead, Neural Network and Fuzzy Logic Applications in C/C++, Wiley, New York, 1994, 395--421.]]
[9]
K. Arisha, F. Ozcan, R. Ross et al., Impact: A Platform for Collaborating Agents, IEEE Intelligent Systems &Their Applications, 14(2), 1999, 64--72.]]
[10]
W. Brenner, R. Zarnekow, and H. Wittig, Intelligent Software Agents: Foundations and Applications, Springer, 1998.]]
[11]
R. G. Smith, The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver, IEEE Transactions on Computers, 29(12), 1980, 1104--1113.]]
[12]
H. C. Wong and K. Sycara, A Taxonomy of Middle Agents for the Internet, Proceedings of 4th ICMAS, IEEE Computer Society Press, 2000, 465--466.]]
[13]
K. Sycara, M. Klusch, and S. Widoff, Dynamic Service Matchmaking Among Agents in Open Information Environments, SIGMOD Record, 28(1), 1999, 47--53.]]
[14]
D. Kuokka and L. Harada, Matchmaking for Information Agents, Proceedings of 14th IJCAI, 1995, 672--678.]]
[15]
N. Singh, A Common Lisp API and Facilitator for ABSI: Version 2.0.3, Technical Report Logic-93-4, Logic Group, Computer Science Department, Stanford University, 1993.]]
[16]
M. Paolucci, Z. Niu, K. Sycara et al., Matchmaking to Support Intelligent Agents for Portfolio Management, Proceedings of AAAI'2000 (Demo Session), http://www.cs.cmu.edu/ ˜softagents/publications.html.]]
[17]
K. Sycara, J. Lu, M. Klusch, and S. Widoff, Matchmaking Among Heterogeneous Agents on the Internet, Proceedings of AAAI Spring Symposium on Intelligent Agents in Cyberspace, Stanford, USA, 1999, http://www.cs.cmu.edu/ ˜softagents/publications.html.]]
[18]
G. J. Wickler, Using Expressive and Flexible Action Representations to Reason about Capabilities for Intelligent Agent Cooperation, PhD thesis, University of Edinburgh, 1999.]]
[19]
M. Klusch and K. Sycara, Brokering and Matchmaking for Coordination of Agent Societies: A Survey, in: A. Omicini, F. Zambonelli, M. Klusch, and R. Tolksdorf (Eds.), Coordination of Internet Agents: Models, Technologies and Applications, Springer, 2001, Chapter 8.]]
[20]
E. Peter, Chaos and Order in the Capital Markets, John Wiley & Sons, Inc., 1991.]]
[21]
F. Hoppner, F. Klawonn, R. Kruse, and T. Runkler, Fuzzy Cluster Analysis, John Wiley & Sons, 1999.]]
[22]
C. Zhang, Z. Zhang, and S. Ong, An Agent-Based Soft Computing Society, Proceedings of 2nd RSCTC, LNAI 2005, Springer, 2001, 661--668.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
July 2002
451 pages
ISBN:1581134800
DOI:10.1145/545056
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 2002

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. intelligent agents
  2. matchmaking
  3. middle agents
  4. multiagent systems

Qualifiers

  • Article

Conference

AAMAS02
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)1
Reflects downloads up to 24 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media