Approximating the termination value of one-counter MDPs and stochastic games

DOI10.1016/j.ic.2012.01.008zbMath1267.68160OpenAlexW2100301927MaRDI QIDQ1951577

Václav Brožek, Antonín Kučera, Kousha Etessami, Tomáš Brázdil

Publication date: 6 June 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.01.008

zbMATH Keywords

terminationtransition graphone-counter automataone-counter MDPsone-counter simple stochastic games

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs, Simple stochastic games with almost-sure energy-parity objectives are in NP and conp, Probabilistic Model Checking for Energy-Utility Analysis