Name
Abstract | ||
|---|---|---|
Simple stochastic games are turn-based 2½-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a conjunction of such conditions as objective. Despite a plethora of recent results on the analysis of systems with multiple objectives, the decidability of this basic problem remains open. In this paper, we present an algorithm approximating the Pareto frontier of the achievable values to a given precision. Moreover, it is an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3373718.3394761 | LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science
Saarbrücken
Germany
July, 2020 |
Keywords | DocType | ISSN |
Stochastic games, Multiple Reachability Objectives, Pareto frontier, Anytime algorithm | Conference | 1043-6871 |
ISBN | Citations | PageRank |
978-1-4503-7104-9 | 1 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashok Pranav | 1 | 1 | 0.68 |
| Krishnendu Chatterjee | 2 | 2179 | 162.09 |
| Jan Kretínský | 3 | 159 | 16.02 |
| Weininger Maximilian | 4 | 1 | 0.68 |
| Winkler Tobias | 5 | 1 | 0.34 |