Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Convex Programming-based Algorithm for Mean Payoff Stochastic Games
  with Perfect Information   We consider two-person zero-sum stochastic mean payoff games with perfect
information, or BWR-games, given by a digraph $G = (V, E)$, with local rewards
$r: E \to \ZZ$, and three types of positions: black $V_B$, white $V_W$, and
random $V_R$ forming a partition of $V$. It is a long-standing open question
whether a polynomial time algorithm for BWR-games exists, even when $|V_R|=0$.
In fact, a pseudo-polynomial algorithm for BWR-games would already imply their
polynomial solvability. In this short note, we show that BWR-games can be
solved via convex programming in pseudo-polynomial time if the number of random
positions is a constant.

31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom