Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computational Complexity of Approximate Nash Equilibrium in Large Games   We prove that finding an epsilon-Nash equilibrium in a succinctly
representable game with many players is PPAD-hard for constant epsilon. Our
proof uses succinct games, i.e. games whose payoff function is represented by a
circuit. Our techniques build on a recent query complexity lower bound by
Babichenko.

10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
19
The categories of this paper are: eess
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con