Matchmaking for information services
Readings in agents
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Communication decisions in multi-agent cooperation: model and experiments
Proceedings of the fifth international conference on Autonomous agents
Eighteenth national conference on Artificial intelligence
Optimizing information exchange in cooperative multi-agent systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Communication for Improving Policy Computation in Distributed POMDPs
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
An integrated token-based algorithm for scalable coordination
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Execution-time communication decisions for coordination of multi-agent teams
Execution-time communication decisions for coordination of multi-agent teams
Agent architectures for flexible, practical teamwork
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Decentralized sensor fusion with distributed particle filters
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Towards an Understanding of the Value of Cooperation in Uncertain World
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Information sharing and searching via collaborative reinforcement learning
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
| Hi-index | 0.00 |
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and delivering it efficiently across a team has been the focus of much research, with proposed approaches ranging from flooding to complex filters and matchmakers. Interestingly, random forwarding of information has been found to be a surprisingly effective information sharing approach in some domains. In this paper, we investigate this phenomenon in detail and show that in certain systems, random forwarding of information performs almost half as well as a globally optimal approach. We present analytic and empirical results comparing random methods with theoretically optimal sharing in small-worlds, scale-free, and random networks. In addition, we demonstrate a method for modeling real domains that allows our results to be applied toward estimating information sharing performance.