Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the computational complexity of solving stochastic mean-payoff games   We consider some well-known families of two-player, zero-sum, perfect
information games that can be viewed as special cases of Shapley's stochastic
games. We show that the following tasks are polynomial time equivalent:
  - Solving simple stochastic games.
  - Solving stochastic mean-payoff games with rewards and probabilities given
in unary. - Solving stochastic mean-payoff games with rewards and probabilities
given in binary.

37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph