Computer Science – Multiagent Systems
Scientific paper
1999-05-10
Proceedings of the Third International Conference on Autonomous Agents, Seatle, WA 1999
Computer Science
Multiagent Systems
7 pages, 6 figures
Scientific paper
We consider the problem of how to design large decentralized multi-agent systems (MAS's) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a reinforcement learning algorithm. This converts the problem into one of how to automatically set/update the reward functions for each of the agents so that the global goal is achieved. In particular we do not want the agents to ``work at cross-purposes'' as far as the global goal is concerned. We use the term artificial COllective INtelligence (COIN) to refer to systems that embody solutions to this problem. In this paper we present a summary of a mathematical framework for COINs. We then investigate the real-world applicability of the core concepts of that framework via two computer experiments: we show that our COINs perform near optimally in a difficult variant of Arthur's bar problem (and in particular avoid the tragedy of the commons for that problem), and we also illustrate optimal performance for our COINs in the leader-follower problem.
Tumer Kagan
Wheeler Kevin R.
Wolpert David H.
No associations
LandOfFree
General Principles of Learning-Based Multi-Agent Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with General Principles of Learning-Based Multi-Agent Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General Principles of Learning-Based Multi-Agent Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-566590