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.

中文翻译：

---

更快的后悔匹配

Sergiu Hart 提出的遗憾匹配算法是寻找相关均衡的最强大的迭代方法之一。但是，它可能不够有效，尤其是在大规模问题中。我们首先基于遗憾矩阵的思想以计算上实用的方式重写算法。而且，重写使原始算法更容易理解。然后通过对原始算法的一些修改，我们引入了一个新的变体，即更快的遗憾匹配。实验结果表明，与原算法相比，新算法具有速度优势。