Minimizing Expected Termination Time in One-Counter Markov Decision Processes
From MaRDI portal
Publication:3167006
DOI10.1007/978-3-642-31585-5_16zbMath1367.68162arXiv1205.1473OpenAlexW1963370831MaRDI QIDQ3167006
Tomáš Brázdil, Petr Novotný, Dominik Wojtczak, Antonín Kučera
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1473
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Recursive stochastic games with positive rewards ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Computing expected runtimes for constant probability programs
This page was built for publication: Minimizing Expected Termination Time in One-Counter Markov Decision Processes
