Pith. sign in

REVIEW

Approximating Values of Generalized-Reachability Stochastic Games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.05106 v2 pith:ZJ5W577O submitted 2019-08-14 cs.GT cs.LO

Pranav Ashok , Krishnendu Chatterjee , Jan Kretinsky , Maximilian Weininger , Tobias Winkler This is my paper
classification cs.GTcs.LO
keywords gamesgivenalgorithmapproximatingbasicobjectiveplayerstochastic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Simple stochastic games are turn-based 2.5-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.

Discussion (0). Sign in to comment.

Pith tools