Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic systems with time constraints. We propose a new distributed technique which scales well, and still maintains relatively low matchmaking time and communication overhead. Our technique introduces very low storage and computational overhead to the agents. We suggest using a matching cache which can take advantage of the multidirectional nature of the matchmaking problem. We empirically evaluate the proposed technique on bilateral matchmaking and show that it out-performs the existing techniques.
|Original language||American English|
|Title of host publication||7th international joint conference on Autonomous agents and multiagent systems|
|Publisher||International Foundation for Autonomous Agents and Multiagent Systems|
|State||Published - 2008|