37 citations · 37 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2010
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…
cs.GT2010★ 37 cited
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…