One-Counter Stochastic Games
From MaRDI portal
Publication:2908841
DOI10.4230/LIPIcs.FSTTCS.2010.108zbMath1245.68099arXiv1009.5636OpenAlexW2155340214MaRDI QIDQ2908841
Tomáš Brázdil, Václav Brožek, Kousha Etessami
Publication date: 29 August 2012
Full work available at URL: https://arxiv.org/abs/1009.5636
Markov decision processlimitterminationlong run average rewardsimple stochastic gamesone-counter automata
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
Submixing and shift-invariant stochastic games ⋮ The Viterbi algorithm for subsets of stochastic context-free languages ⋮ Unnamed Item ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Runtime Analysis of Probabilistic Programs with Unbounded Recursion ⋮ Approximating the Termination Value of One-Counter MDPs and Stochastic Games ⋮ Analyzing probabilistic pushdown automata ⋮ Probabilistic Model Checking for Energy-Utility Analysis ⋮ On decidability and complexity of low-dimensional robot games ⋮ Runtime analysis of probabilistic programs with unbounded recursion ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ Computing expected runtimes for constant probability programs ⋮ Efficient Analysis of Probabilistic Programs with an Unbounded Counter
This page was built for publication: One-Counter Stochastic Games
