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

合作贝叶斯博弈中的开发结构

Exploiting Structure in Cooperative Bayesian Games

Maastricht University(马斯特里赫特大学);University of Amsterdam(阿姆斯特丹大学);Delft University of Technology(代尔夫特理工大学)

Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J. Spaan

摘要:

合作贝叶斯博弈(BGs)可以在不完全信息下为代理团队建模决策问题,但需要的空间和计算时间是代理数量的指数。虽然代理的独立性已被用来缓解这些问题,在完美的信息设置,我们提出了一种新的方法,BG的基础上观察,BG还具有不同类型的结构,我们称之为类型的独立性。我们提出了一个因子图表示,捕获两种形式的独立性,并提出了一个理论分析表明,非串行动态规划不能有效地利用类型的独立性,而最大和可以。实验结果表明,我们的方法可以解决前所未有的规模合作贝叶斯游戏。

英文摘要:

Cooperative Bayesian games (BGs) can model decision-making problems for teams of agents under imperfect information, but require space and computation time that is exponential in the number of agents. While agent independence has been used to mitigate these problems in perfect information settings, we propose a novel approach for BGs based on the observation that BGs additionally possess a different types of structure, which we call type independence. We propose a factor graph representation that captures both forms of independence and present a theoretical analysis showing that non-serial dynamic programming cannot effectively exploit type independence, while Max-Sum can. Experimental results demonstrate that our approach can tackle cooperative Bayesian games of unprecedented size.

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

↑