Approximating Values of Generalized-Reachability Stochastic Games
From MaRDI portal
Publication:5145624
DOI10.1145/3373718.3394761zbMath1455.91035arXiv1908.05106OpenAlexW3032532589MaRDI QIDQ5145624
Maximilian Weininger, Krishnendu Chatterjee, Pranav Ashok, Jan Křetínský, Tobias Winkler
Publication date: 21 January 2021
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.05106
Analysis of algorithms (68W40) Stochastic games, stochastic differential games (91A15) Approximation algorithms (68W25)
Related Items
Automatic verification of concurrent stochastic systems ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Unnamed Item ⋮ Multi-objective optimization of long-run average and total rewards ⋮ Comparison of algorithms for simple stochastic games ⋮ Verification of multiplayer stochastic games via abstract dependency graphs
