论文标题
更快的遗憾匹配
Faster Regret Matching
论文作者
论文摘要
Sergiu Hart提出的遗憾匹配算法是找到相关平衡的最强大的迭代方法之一。但是，这可能不够有效，尤其是在大规模问题中。我们首先根据遗憾矩阵的想法以计算实用的方式重写该算法。此外，重写使原始算法更容易理解。然后，通过对原始算法进行一些修改，我们引入了一种新颖的变体，即更快的遗憾匹配。实验结果表明，与原始算法相比，新型算法具有速度优势。
The regret matching algorithm proposed by Sergiu Hart is one of the most powerful iterative methods in finding correlated equilibrium. However, it is possibly not efficient enough, especially in large scale problems. We first rewrite the algorithm in a computationally practical way based on the idea of the regret matrix. Moreover, the rewriting makes the original algorithm more easy to understand. Then by some modification to the original algorithm, we introduce a novel variant, namely faster regret matching. The experiment result shows that the novel algorithm has a speed advantage comparing to the original one.
