DeepAI AI Chat
Log In Sign Up

Approximating Values of Generalized-Reachability Stochastic Games

08/14/2019
by   Pranav Ashok, et al.
0

Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether player Max can win a given game with at least a given probability. A natural extension are games with a conjunction of such conditions as objective. Despite a plethora of recent results on analysis of systems with multiple objectives, decidability of this basic problem remains open. In this paper, we show the Pareto frontier of the achievable values can be approximated to a given precision. In particular, our algorithm is not limited to stopping games and can be run as an anytime algorithm, always returning the current approximation and its error bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/17/2021

Stackelberg-Pareto Synthesis (Full Version)

In this paper, we study the framework of two-player Stackelberg games pl...
09/13/2019

Controlling a Random Population is EXPTIME-hard

Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in wh...
06/11/2018

Reachability for Branching Concurrent Stochastic Games

We give polynomial time algorithms for deciding almost-sure and limit-su...
08/10/2021

Stochastic Games with Disjunctions of Multiple Objectives (Technical Report)

Stochastic games combine controllable and adversarial non-determinism wi...
09/17/2021

Stochastic Games with Disjunctions of Multiple Objectives

Stochastic games combine controllable and adversarial non-determinism wi...
09/17/2019

Reachability Games with Relaxed Energy Constraints

We study games with reachability objectives under energy constraints. We...
12/18/2021

Playing Against Fair Adversaries in Stochastic Games with Total Rewards

We investigate zero-sum turn-based two-player stochastic games in which ...