DeepAI AI Chat
Log In Sign Up

Quantitative Reductions and Vertex-Ranked Infinite Games

09/10/2018
by   Alexander Weinert, et al.
Universität Saarland
0

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable properties as their qualitative counterparts and additionally retain the optimality of solutions. Moreover, we introduce vertex-ranked games as a general-purpose target for quantitative reductions and show how to solve them. In such games, the value of a play is determined only by a qualitative winning condition and a ranking of the vertices. We provide quantitative reductions of quantitative request-response games to vertex-ranked games, thus showing ExpTime-completeness of solving the former games. Furthermore, we exhibit the usefulness and flexibility of vertex-ranked games by showing how to use such games to compute fault-resilient strategies for safety specifications. This work lays the foundation for a general study of fault-resilient strategies for more complex winning conditions

READ FULL TEXT

page 1

page 2

page 3

page 4

12/10/2019

Optimally Resilient Strategies in Pushdown Safety Games

Infinite-duration games with disturbances extend the classical framework...
04/17/2018

Parity Games with Weights

Quantitative extensions of parity games have recently attracted signific...
05/31/2023

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games (full version)

We compare games under delayed control and delay games, two types of inf...
01/24/2022

On-The-Fly Solving for Symbolic Parity Games

Parity games can be used to represent many different kinds of decision p...
09/12/2021

Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings

The concept of nimbers–a.k.a. Grundy-values or nim-values–is fundamental...
10/20/2019

Computing Branching Distances Using Quantitative Games

We lay out a general method for computing branching distances between la...
08/26/2020

Optimal Strategies in Weighted Limit Games (full version)

We prove the existence and computability of optimal strategies in weight...