Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Query Complexity of Correlated Equilibrium   We study lower bounds on the query complexity of determining correlated
equilibrium. In particular, we consider a query model in which an n-player game
is specified via a black box that returns players' utilities at pure action
profiles. In this model we establish that in order to compute a correlated
equilibrium any deterministic algorithm must query the black box an exponential
(in n) number of times.

33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
24
The categories of this paper are: dg-ga
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph