Towards bidirectional distributed matchmaking

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1405-1408
Number of pages4
ISBN (Print)9781605604701
StatePublished - 2008
Event7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008 - Estoril, Portugal
Duration: 12 May 200816 May 2008

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume3
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008
Country/TerritoryPortugal
CityEstoril
Period12/05/0816/05/08

Keywords

  • Distributed
  • Evaluation
  • Matchmaking
  • Peer to peer

Fingerprint

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

Cite this