Towards bidirectional distributed matchmaking

Victor Shafran, Gal Kaminka, Sarit Kraus, Claudia V. Goldman

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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 outperforms the existing techniques. Copyright © 2008, International Foundation for Autonomous Agents and Multiagent Systems ( All rights reserved.


Dive into the research topics of 'Towards bidirectional distributed matchmaking'. Together they form a unique fingerprint.

Cite this