Multiagent learning in the presence of memory-bounded agents

详细信息    查看全文

• 作者：Doran Chakraborty (1)
  Peter Stone (2)
  
• 关键词：Multiagent learning ; Memory ; bounded agents ; Sample complexity analysis
• 刊名：Autonomous Agents and Multi-Agent Systems
• 出版年：2014
• 出版时间：March 2014
• 年：2014
• 卷：28
• 期：2
• 页码：182-213
• 全文大小：436 KB
• 作者单位：Doran Chakraborty (1)
  Peter Stone (2)
  
  1. Microsoft, 1080 Enterprise Way, Sunnyvale, CA, 94089, USA
  2. Department of Computer Science, The University of Texas, Austin, TX, 78701, USA
  
• ISSN：1573-7454

文摘

In recent years, great strides have been made towards creating autonomous agents that can learn via interaction with their environment. When considering just an individual agent, it is often appropriate to model the world as being stationary, meaning that the same action from the same state will always yield the same (possibly stochastic) effects. However, in the presence of other independent agents, the environment is not stationary: an action’s effects may depend on the actions of the other agents. This non-stationarity poses the primary challenge of multiagent learning and comprises the main reason that it is best considered distinctly from single agent learning. The multiagent learning problem is often studied in the stylized settings provided by repeated matrix games. The goal of this article is to introduce a novel multiagent learning algorithm for such a setting, called Convergence with Model Learning and Safety?(or CMLeS), that achieves a new set of objectives which have not been previously achieved. Specifically, CMLeS is the first multiagent learning algorithm to achieve the following three objectives: (1) converges to following a Nash equilibrium joint-policy in self-play; (2) achieves close to the best response when interacting with a set of memory-bounded agents whose memory size is upper bounded by a known value; and (3) ensures an individual return that is very close to its security value when interacting with any other set of agents. Our presentation of CMLeS is backed by a rigorous theoretical analysis, including an analysis of sample complexity wherever applicable.