Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations

From MaRDI portal

(Redirected from Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Polynomial_time_algorithms_for_branching_Markov_decision_processes_and_probabilistic_min(max)_polynomial_Bellman_equations&oldid=79779467"