Location of Repository

Unstructured Agent Matchmaking: Experiments in Timing and Fuzzy Matching

By Elth Ogston and Stamatis Vassiliadis


We i nvestigate distributed matchmaking within an multiagent 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 di#erent models of continuous time. We find little di#erence between the two, indicating that the ordering of events does not play a part in computation. We a l so 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 thesystem finds matches. For instance, we show that for atriangular matching function, doubling the probability of each service matching results in about a 1.6 times speedup. Keywords multi-agent systems, peer-to-peer computing, matchmaking 1

Year: 2002
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://lia.deis.unibo.it/confs... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.