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

博弈论的图形模型

Graphical Models for Game Theory

Syntek Capital(Syntek资本);AT&T Labs–Research(AT&T实验室-研究)

Michael Kearns, Michael L. Littman, Satinder Singh

摘要:

在这项工作中,我们介绍了图形modelsfor多玩家博弈理论,并给出了强大的算法,在某些情况下计算其纳什均衡。一个n人博弈是由一个在n个节点上的无向图和一组n个局部矩阵给出的。其解释是,参与人i的收益完全取决于参与人i和他在图中的邻居的行为,因此参与人i的收益矩阵只由这些参与人索引。因此,我们认为全球n玩家游戏是由相互作用的本地游戏,每个涉及少得多的球员。每个玩家的行动可能会有全球性的影响,但它发生通过传播的本地influence.Our主要的技术成果是一个有效的算法计算纳什均衡时,底层图是一棵树(或可以变成一棵树与几个节点合并)。该算法在时间多项式中运行的表示(图和相关的局部博弈矩阵)的大小,并在两个相关的,但不同的口味。第一个版本涉及近似步骤,并计算所有近似纳什均衡的表示(通常可能存在指数)。第二个版本允许精确计算纳什均衡的代价是削弱复杂性界限。该算法只需要节点之间的本地消息传递(因此可以由玩家自己以分布式方式实现)。尽管类比推理贝叶斯网,我们开发的,我们的算法的分析是更多的参与比多边形树算法,部分原因是这样一个事实,即我们必须计算,或选择,指数数量的潜在解决方案。我们讨论了一些扩展,如计算的均衡与理想的全球性能(例如,最大化的全球回报),和进一步的研究方向。

英文摘要:

In this work, we introduce graphical modelsfor multi-player game theory, and give powerful algorithms for computing their Nash equilibria in certain cases. An n-player game is given by an undirected graph on n nodes and a set of n local matrices. The interpretation is that the payoff to player i is determined entirely by the actions of player i and his neighbors in the graph, and thus the payoff matrix to player i is indexed only by these players. We thus view the global n-player game as being composed of interacting local games, each involving many fewer players. Each player's action may have global impact, but it occurs through the propagation of local influences.Our main technical result is an efficient algorithm for computing Nash equilibria when the underlying graph is a tree (or can be turned into a tree with few node mergings). The algorithm runs in time polynomial in the size of the representation (the graph and theassociated local game matrices), and comes in two related but distinct flavors. The first version involves an approximation step, and computes a representation of all approximate Nash equilibria (of which there may be an exponential number in general). The second version allows the exact computation of Nash equilibria at the expense of weakened complexity bounds. The algorithm requires only local message-passing between nodes (and thus can be implemented by the players themselves in a distributed manner). Despite an analogy to inference in Bayes nets that we develop, the analysis of our algorithm is more involved than that for the polytree algorithm in, owing partially to the fact that we must either compute, or select from, an exponential number of potential solutions. We discuss a number of extensions, such as the computation of equilibria with desirable global properties (e.g. maximizing global return), and directions for further research.

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

↑