论文标题
多人游戏中NASH平衡计算的虚拟游戏的经验分析
Empirical Analysis of Fictitious Play for Nash Equilibrium Computation in Multiplayer Games
论文作者
论文摘要
虽然虚拟游戏可以保证在某些游戏类（例如两人零和游戏）中融合到NASH均衡，但不能保证在非零-SUM和多人游戏中融合。我们表明，实际上，虚构的戏剧可改善纳什均衡近似值，而不是（反事实）遗憾的最小化，这是最近为多人游戏扑克制作了超人游戏。我们还表明，当使用随机初始化几次进行虚拟游戏时，可以解决一些已知的挑战问题，其中已知标准版本不收敛，包括Shapley的经典反例。尽管最糟糕的理论结果是负面的，但在这些环境中，这些在这些环境中为虚拟游戏提供了一些第一个积极的结果。
While fictitious play is guaranteed to converge to Nash equilibrium in certain game classes, such as two-player zero-sum games, it is not guaranteed to converge in non-zero-sum and multiplayer games. We show that fictitious play in fact leads to improved Nash equilibrium approximation over a variety of game classes and sizes than (counterfactual) regret minimization, which has recently produced superhuman play for multiplayer poker. We also show that when fictitious play is run several times using random initializations it is able to solve several known challenge problems in which the standard version is known to not converge, including Shapley's classic counterexample. These provide some of the first positive results for fictitious play in these settings, despite the fact that worst-case theoretical results are negative.
