|
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
|
R. J. Bayardo, Jr. , W. Bohrer , R. Brice , A. Cichocki , J. Fowler , A. Helal , V. Kashyap , T. Ksiezyk , G. Martin , M. Nodine , M. Rashid , M. Rusinkiewicz , R. Shea , C. Unnikrishnan , A. Unruh , D. Woelk, InfoSleuth: agent-base semantic integration of information in open and dynamic environments, Readings in agents, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1997
|
| |
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
|
Khaled A. Arisha , Fatma Ozcan , Robert Ross , V. s. Subrahmanian , Thomas Eiter , Sarit Kraus, Impact: A Platform for Collaborating Agents, IEEE Intelligent Systems, v.14 n.2, p.64-72, March 1999
[doi> 10.1109/5254.757633]
|
| |
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
|
Massimo Paolucci , Zhendong Niu , Katia P. Sycara , Constantine Domashnev , Sean Owens , Martin Van Velsen, Matchmaking to Support Intelligent Agents for Portfolio Management, Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, p.1125-1126, July 30-August 03, 2000
|
| |
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
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|