首页> 外文会议>Proceedings of the 2007 International Conference on Machine Learning and Cybernetics >A NEW LEARNING ALGORITHM FOR COOPERATIVE AGENTS IN GENERAL-SUM GAMES
【24h】

A NEW LEARNING ALGORITHM FOR COOPERATIVE AGENTS IN GENERAL-SUM GAMES

机译:通用和游戏中合作代理的新学习算法

获取原文

摘要

The development of multi-agent reinforcement learning in stochastic game has been slowed down in recent years.The main problem is that it is difficult to make the learning satisfy rationality and convergence at the same time.Here, the typical learning algorithms are analyzed firstly, and then a new method called Pareto-Q is prompted with the concept of Pareto optimum, which is rational.At the same time, social conventions are also introduced to promise the convergence of learning.At the last, experiments are presented to prove the good learning result of this algorithm.
机译:近年来,随机游戏中多智能体强化学习的发展一直在放缓,主要问题在于难以使学习同时满足合理性和收敛性。在此,首先分析典型的学习算法,然后以帕累托最优的概念提出了一种称为帕累托Q的新方法,该方法是合理的。与此同时,还引入了社会习俗来保证学习的收敛性。最后,通过实验证明了这一方法的优越性。该算法的学习结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号