Log In Sign Up

From Quasi-Dominions to Progress Measures

by   Massimo Benerecetti, et al.

In this paper we revisit the approaches to the solution of parity games based on progress measures and show how the notion of quasi dominions can be integrated with those approaches. The idea is that, while progress measure based techniques typically focus on one of the two players, little information is gathered on the other player during the solution process. Adding quasi dominions provides additional information on this player that can be leveraged to accelerate convergence to a progress measure. To accommodate quasi dominions, however, a non trivial refinement of the approach is necessary. In particular, we need to introduce a novel notion of measure and a new approach to prove correctness of the resulting solution technique.


page 1

page 2

page 3

page 4


A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games

In a mean-payoff parity game, one of the two players aims both to achiev...

Solving Mean-Payoff Games via Quasi Dominions

We propose a novel algorithm for the solution of mean-payoff games that ...

Fixpoint Games on Continuous Lattices

Many analysis and verifications tasks, such as static program analyses a...

A symmetric attractor-decomposition lifting algorithm for parity games

Progress-measure lifting algorithms for solving parity games have the be...

A Comparison of Group Criticality Notions for Simple Games

We analyze two independent efforts to extend the notion of criticality i...

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

Solving parity games, which are equivalent to modal μ-calculus model che...

Extra-gradient with player sampling for provable fast convergence in n-player games

Data-driven model training is increasingly relying on finding Nash equil...