arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3253cs.GTcs.AI
收藏

通过一种基于机器人的表示来学习和解决多人博弈

Learning and Solving Many-Player Games through a Cluster-Based Representation

Harvard School of Engineering and Applied Sciences(哈佛工程与应用科学学院)

Sevan G. Ficici, David C. Parkes, Avi Pfeffer

摘要:

在解决的挑战,指数缩放与代理的数量,我们采用了基于集群的表示近似解决非常多的球员的非对称游戏。一个集群将具有类似游戏“战略观点”的代理分组在一起。我们从由策略配置文件和收益组成的数据中学习聚类近似,这些数据可以从对游戏的观察或对模拟器的访问中获得。使用我们的聚类,我们构建了一个简化的“双胞胎”游戏,其中每个集群与两个球员的简化游戏。这使得我们的表示能够单独响应,因为我们将每个个体代理的利益与其集群的策略相一致。我们的方法为代理提供了更高的回报和更低的遗憾平均比无模型的方法以及以前的基于聚类的方法,只需要很少的观察学习是成功的。“双胞胎”方法被证明是提供这些低遗憾近似值的重要组成部分。

英文摘要:

In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. A cluster groups together agents with a similar "strategic view" of the game. We learn the clustered approximation from data consisting of strategy profiles and payoffs, which may be obtained from observations of play or access to a simulator. Using our clustering we construct a reduced "twins" game in which each cluster is associated with two players of the reduced game. This allows our representation to be individually- responsive because we align the interests of every individual agent with the strategy of its cluster. Our approach provides agents with higher payoffs and lower regret on average than model-free methods as well as previous cluster-based methods, and requires only few observations for learning to be successful. The "twins" approach is shown to be an important component of providing these low regret approximations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑