One-Counter Stochastic Games
| Autoři | |
|---|---|
| Rok publikování | 2010 |
| Druh | Článek ve sborníku |
| Konference | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | |
| Obor | Informatika |
| Klíčová slova | one-counter automata; simple stochastic games; Markov decision process; termination; long run average reward |
| Popis | 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 stochastic games played on transition graphs of classic one-counter automata. We study primarily the termination objective, where one player has to maximize the probability of reaching counter value 0, while the other player wishes to avoid this. Partly motivated by the goal of understanding termination objectives, we also study certain ``limit'' and ``long run average'' reward objectives. We show that the qualitative termination problem for OC-SSGs is both in NP and coNP, and in P-time for 1-player OC-SSGs. Moreover, we show that quantitative limit problems for OC-SSGs are both in NP and coNP, and are in P-time for 1-player OC-MDPs. Both qualitative limit problems and qualitative termination problems for OC-SSGs are already at least as hard as Condon's quantitative decision problem for finite-state SSGs. |
| Související projekty: |