37 citations · 40 across the 4 of their papers we have counts for
4 papers
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
Tomáš Brázdil, Václav Brožek, Kousha Etessami +1
One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of clas…
One-Counter Stochastic Games
Tomáš Brázdil, Václav Brožek, Kousha Etessami
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stocha…
Qualitative Reachability in Stochastic BPA Games
Tomáš Brázdil, Václav Brožek, Antonín Kučera +1
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is…
One-Counter Markov Decision Processes
Tomáš Brázdil, Václav Brožek, Kousha Etessami +2
We study the computational complexity of central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. OC-MDPs…