Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Faster Regret Matching   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.

11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
4
The categories of this paper are: cond-mat
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con