arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4128cs.GT
收藏

图对策的Nash均衡计算

Computing Nash Equilibria of Action-Graph Games

Navin Bhat, Kevin Leyton-Brown

摘要:

图博弈(AGG)是一种完全可表达的博弈表示,它可以简洁地表达博弈者效用函数之间的严格独立性和特定于上下文的独立性。行动被表示为图G中的节点,选择行动s的代理人的收益仅取决于选择与s相连的行动的其他代理人的数量。我们提出了算法计算对称和任意平衡的AGG使用连续的方法。我们分析了最坏情况下计算支付函数的雅可比矩阵的成本,指数时间瓶颈步骤,并在所有情况下实现指数加速。当G的入度有界且博弈对称时,雅可比矩阵可以在多项式时间内计算。

英文摘要:

Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functions. Actions are represented as nodes in a graph G, and the payoff to an agent who chose the action s depends only on the numbers of other agents who chose actions connected to s. We present algorithms for computing both symmetric and arbitrary equilibria of AGGs using a continuation method. We analyze the worst-case cost of computing the Jacobian of the payoff function, the exponential-time bottleneck step, and in all cases achieve exponential speedup. When the indegree of G is bounded by a constant and the game is symmetric, the Jacobian can be computed in polynomial time.

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

↑