ACM Home Page
Please provide us with feedback. Feedback
An improvement to matchmaking algorithms for middle agents
Full text PdfPdf (193 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3 table of contents
Bologna, Italy
SESSION: Session 12C: middle agents table of contents
Pages: 1340 - 1347  
Year of Publication: 2002
ISBN:1-58113-480-0
Authors
Zili Zhang  Deakin University, Geelong Victoria, Australia
Chengqi Zhang  University of Technology, Sydney, Australia
Sponsors
ACM: Association for Computing Machinery
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 45,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/545056.545129
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
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
 
4
 
5
 
6
K. Decker, K. Sycara, and M. Williamson, Middle Agents for the Internet, Proceedings of 15th IJCAI, Nogoya, Japan, 1997, 578--583.
7
 
8
 
9
 
10
 
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
13
 
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
 
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
 
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


Collaborative Colleagues:
Zili Zhang: colleagues
Chengqi Zhang: colleagues

Peer to Peer - Readers of this Article have also read: