Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computational Approaches for Stochastic Shortest Path on Succinct MDPs   We consider the stochastic shortest path (SSP) problem for succinct Markov
decision processes (MDPs), where the MDP consists of a set of variables, and a
set of nondeterministic rules that update the variables. First, we show that
several examples from the AI literature can be modeled as succinct MDPs. Then
we present computational approaches for upper and lower bounds for the SSP
problem: (a)~for computing upper bounds, our method is polynomial-time in the
implicit description of the MDP; (b)~for lower bounds, we present a
polynomial-time (in the size of the implicit description) reduction to
quadratic programming. Our approach is applicable even to infinite-state MDPs.
Finally, we present experimental results to demonstrate the effectiveness of
our approach on several classical examples from the AI literature.

11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat