Parity Games with Weights

by   Sven Schewe, et al.

Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with costs. Finitary parity games enjoy a special status among these extensions, as they offer a native combination of the qualitative and quantitative aspects in infinite games: the quantitative aspect of finitary parity games is a quality measure for the qualitative aspect, as it measures the limit superior of the time it takes to answer an odd color by a larger even one. Finitary parity games have been extended to parity games with costs, where each transition is labelled with a non-negative weight that reflects the costs incurred by taking it. We lift this restriction and consider parity games with costs with arbitrary integer weights. We show that solving such games is in NP ∩ coNP, the signature complexity for games of this type. We also show that the protagonist has finite-state winning strategies, and provide tight exponential bounds for the memory he needs to win the game. Naturally, the antagonist may need need infinite memory to win. Finally, we present tight bounds on the quality of winning strategies for the protagonist.



There are no comments yet.


page 1

page 2

page 3

page 4


Combinations of Qualitative Winning for Stochastic Parity Games

We study Markov decision processes and turn-based stochastic games with ...

A Recursive Approach to Solving Parity Games in Quasipolynomial Time

Zielonka's classic recursive algorithm for solving parity games is perha...

Resource-Aware Automata and Games for Optimal Synthesis

We consider quantitative notions of parity automaton and parity game aim...

Quantitative Reductions and Vertex-Ranked Infinite Games

We introduce quantitative reductions, a novel technique for structuring ...

Aspects of Muchnik's paradox in restricted betting

Muchnik's paradox says that enumerable betting strategies are not always...

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP

We study stochastic games with energy-parity objectives, which combine q...

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

The beyond worst-case synthesis problem was introduced recently by Bruyè...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.