Elth Ogston
ABSTRACT
We investigate distributed matchmaking within an multi-agent system in which agents communicate in a peer-to-peer fashion with a limited set of neighbors. We compare the performance of a system with synchronized time to that of systems using several different models of continuous time. We find little difference between the two, indicating that the ordering of events does not play a part in computation. We also compare a system in which matches are made deterministically between discrete task categories to one in which task matches are made non-deterministically between continuous task categories. We consider several possible matching functions and show that their support is proportional to the spread of categories tolerable. This holds for matching probabilities as low as 0.01. We further show that the matching function's 'height' relates to the speed at which the system finds matches. For instance, we show that for a triangular matching function, doubling the probability of each service matching results in about a 1.6 times speedup.
- Chavez, A., Maes, P.: Kasbah: An Agent Marketplace for Buying and Selling Goods. Proceedings 1st Int. Conference on the Practical Appication of Intelligent Agents and Multi-Agent Technology. (1996) 75-90]]Google Scholar
- Decker, K., Sycara, K., Williamson, M.: Middle-Agents for the Internet. Proceedings of the 15th Int. Joint Conference on Artificial Intelligence. (1997) 578-583]]Google Scholar
- Kuokka, D., Harada, L.: Matchmaking for Information Agents. Proceedings of the 14th International Joint Conference on Artificial Intelligence. (1995) 672-678]]Google Scholar
- Ogston, E., Vassiliadis, S.: Local Distributed Agent Matchmaking. Proc. 9th International Conference on Cooperative Information Systems . (2001) 67-79]] Google ScholarDigital Library
- Ogston, E., Vassiliadis, S.: Matchmaking Among Minimal Agents Without a Facilitator. Proc. 5th Int. Conference on Autonomous Agents. (2001) 608-615]] Google ScholarDigital Library
- Preist, C., Van Tol, M.: Adaptive Agents in a Persistent Shout Double Auction. Proc. 1st International Conference on the Internet, Computing and Economics. (1998) 11-17]] Google ScholarDigital Library
- Smith, R.: The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Trans. On Computers, 29(12). (1980) 1104-1113]]Google ScholarDigital Library
- Sycara, K., Lu, J., Klusch, M., Widoff, S.: Matchmaking among Heterogeneous Agents on the Internet. Proc. AAAI Spring Symposium on Intelligent Agents in Cyberspace. (1999)]]Google Scholar
- Vulkan, N., Jennings, N.: Efficient Mechanisms for the Supply of Services in Multi-Agent Environments. Int. Journal of Decision Support Systems, 28(1-2) (2000) 5-19]] Google ScholarDigital Library
Index Terms
- Unstructured agent matchmaking: experiments in timing and fuzzy matching
Recommendations
An improvement to matchmaking algorithms for middle agents
AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3A 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 ...
Matchmaking among minimal agents without a facilitator
AGENTS '01: Proceedings of the fifth international conference on Autonomous agentsMulti-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents must have to allow them to work together effectively. In this paper, we ...
Semantic matchmaking of web services using model checking
AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly based on matching the input-output parameters of service requests and ...
Comments