205 search results - page 1 / 41 » One-Counter Stochastic Games |
107
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
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 stoch...
83
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
86
Voted
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
111
Voted
Presentation
This presentation was to explain seminal paper on stochastic games by Shapley
108
Voted
IPL
2008
14 years 10 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...