Communication decisions in multi-agent cooperation: model and experiments
Proceedings of the fifth international conference on Autonomous agents
Optimizing information exchange in cooperative multi-agent systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A decision-theoretic approach for designing proactive communication in multi-agent teamwork
Proceedings of the 2004 ACM symposium on Applied computing
Ad Hoc, self-supervising peer-to-peer search networks
ACM Transactions on Information Systems (TOIS)
An integrated token-based algorithm for scalable coordination
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
The Journal of Machine Learning Research
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Information searching and sharing in large-scale dynamic networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Searching and sharing information in networks of heterogeneous agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Analyzing the performance of randomized information sharing
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Decentralized control of cooperative systems: categorization and complexity analysis
Journal of Artificial Intelligence Research
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper proposes a method for computing a routing policy-value function for effective information sharing and searching in arbitrary networks of agents through collaborative reinforcement learning. This is done by means of local computations performed by agents and payoff propagation. The aim is to ‘tune' a network of agents for efficient and effective information searching and sharing, without altering the topology or imposing an overlay structure.