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

Mathematics of Operations Research, pp. 34-62, 2019.

Cited by: 0|Bibtex|Views11|Links
EI

Abstract:

We show that one can compute the least nonnegative solution (also known as the least fixed point) for a system of probabilistic min (max) polynomial equations, to any desired accuracy ɛ u003e 0 in time...

Code:

Data:

Your rating :
0

 

Tags
Comments