Online tracking of mobile users
Journal of the ACM (JACM)
Efficient mechanisms for the supply of services in multi-agent environments
Decision Support Systems - Special issue on information and computational economics
Matchmaking among minimal agents without a facilitator
Proceedings of the fifth international conference on Autonomous agents
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
A Scalable Agent Location Mechanism
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Matchmaking for information agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Methods for task allocation via agent coalition formation
Artificial Intelligence
A probabilistic mechanism for agent discovery and pairing using domain-specific data
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent 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 |
This paper explores through simulation an abstract model of distributed matchmaking within multi-agent systems. We show that under certain conditions agents can find matches for cooperative tasks without the help of a predefined organization or central facilitator. We achieve this by having each agent search for partners among a small changing set of neighbors. We work with a system where agents look for any one of a number of identical task matches, and where the number of categories of tasks can be as large as 100. Agents dynamically form clusters 10 to 100 agents in size within which agents cooperate by exchanging addresses of non-matching neighbors. We find that control of these clusters cannot be easily distributed, but that distribution in the system as a whole can be maintained by limiting cluster size. We further show that in a dynamic system where tasks end and clusters change matchmaking can continue indefinitely organizing into newset s of clusters, as long as some agents are willing to be flexible and abandon tasks they cannot find matches for. We show that in this case unmatched tasks can have a probability as lowas .00005 of being changed per turn.