Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

DOI10.1145/1721837.1721849zbMath1300.05303OpenAlexW2043871262MaRDI QIDQ2930309

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1721837.1721849

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

Related Items (2)

The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes ⋮ On the comparison of discounted-sum automata with multiple discount factors

This page was built for publication: Discounted deterministic Markov decision processes and discounted all-pairs shortest paths