Competitive Markov decision processes
Competitive Markov decision processes
Finitely additive stochastic games with Borel measurable payoffs
International Journal of Game Theory
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Time-Bounded Reachability Probabilities in Continuous-Time Markov Decision Processes
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute @e-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute @e-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games.