论文标题
多人纳什平衡的快速完成算法
Fast Complete Algorithm for Multiplayer Nash Equilibrium
论文作者
论文摘要
我们基于一个四倍体的可行性程序公式，描述了一种用于计算多人游戏通用游戏中NASH平衡的新算法。我们证明，该算法的运行速度明显比以前研究过的几个游戏类中的先前最快的完整算法要快得多，并且其运行时间甚至比最佳的不完整算法均优于最佳的算法。
We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games, based on a quadratically-constrained feasibility program formulation. We demonstrate that the algorithm runs significantly faster than the prior fastest complete algorithm on several game classes previously studied and that its runtimes even outperform the best incomplete algorithms.
