You are not logged in.

An improvement to matchmaking algorithms for middle agents

Zhang, Zili and Zhang, Chengqi 2002, An improvement to matchmaking algorithms for middle agents, in Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems : July 15-19, 2002, Plazzo re Enzo, Bologna, Italy, ACM Press, New York, N.Y., pp. 1340-1347.

Attached Files
Name Description MIMEType Size Downloads

Title An improvement to matchmaking algorithms for middle agents
Author(s) Zhang, ZiliORCID iD for Zhang, Zili orcid.org/0000-0002-8721-9333
Zhang, Chengqi
Conference name Autonomous Agents and Multiagent Systems. Joint Conference (1st : 2002 : Bologna, Italy)
Conference location Bologna, Italy
Conference dates 15-19 Jul. 2002
Title of proceedings Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems : July 15-19, 2002, Plazzo re Enzo, Bologna, Italy
Editor(s) Johnson, W. Lewis
Castelfranchi, Cristiano
Publication date 2002
Conference series Autonomous Agents and Multiagent Systems Joint Conference
Start page 1340
End page 1347
Publisher ACM Press
Place of publication New York, N.Y.
Keyword(s) middle agents
matchmaking
multiagent systems
intelligent agents
algorithms
experimentation
Summary 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.


ISBN 1581134800
9781581134803
Language eng
Field of Research 080199 Artificial Intelligence and Image Processing not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2002 ACM
Persistent URL http://hdl.handle.net/10536/DRO/DU:30004678

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 16 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 539 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:40:08 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.