多项式图及其在图形游戏、可拓形式游戏和具有涌现节点树结构的游戏中的应用
Polynomial Graphs With Applications To Graphical Games, Extensive-Form Games, and Games With Emergent Node Tree Structures
摘要：
我们证明了一个定理计算的解决方案的数量的方程组，这是通用的稀疏性条件体现在一个图形。我们将这个定理应用于服从图形模型的游戏和扩展形式的游戏。我们定义涌现节点树结构作为正常形式游戏可能具有的附加结构。我们将我们的定理应用于具有这种结构的游戏。我们简要地讨论如何紧急节点树结构涉及到合作对策。
英文摘要：
We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We define emergent-node tree structures as additional structures which normal form games may have. We apply our theorem to games having such structures. We briefly discuss how emergent node tree structures relate to cooperative games.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
