Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis

Research output: Working paper

Original language	English
Publisher	Computing Research Repository (CoRR)
Volume	abs/1202.4798
Publication status	Published - 2012

Access to Document

@techreport{9b2ac546f0e84ff880e00e97b5a40e70,

title = "Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations",

author = "Kousha Etessami and Alistair Stewart and Mihalis Yannakakis",

year = "2012",

language = "English",

volume = "abs/1202.4798",

publisher = "Computing Research Repository (CoRR)",

type = "WorkingPaper",

institution = "Computing Research Repository (CoRR)",

}

TY - UNPB

T1 - Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

AU - Etessami, Kousha

AU - Stewart, Alistair

AU - Yannakakis, Mihalis

PY - 2012

Y1 - 2012

M3 - Working paper

VL - abs/1202.4798

BT - Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

PB - Computing Research Repository (CoRR)

ER -