Introduction to algorithms
Matchmaking among minimal agents without a facilitator
Proceedings of the fifth international conference on Autonomous agents
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A Scalable Agent Location Mechanism
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Matchmaking in multi-player on-line games: studying user traces to improve the user experience
Proceedings of Network and Operating System Support on Digital Audio and Video Workshop
Hi-index | 0.00 |
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.