Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version)

@article{Bruyre2016WindowPG,
  title={Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version)},
  author={V{\'e}ronique Bruy{\`e}re and Quentin Hautem and Mickael Randour},
  journal={ArXiv},
  year={2016},
  volume={abs/1609.05952}
}
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode omega-regular properties). Those objectives offer powerful abstraction mechanisms and often yield nice properties such as memoryless determinacy. However, their very nature provides no guarantee on time bounds within which something good can be witnessed… 

Figures and Tables from this paper

Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives
TLDR
This work studies window parity objectives in timed automata and timed games and shows that checking that all time-divergent paths of a timed automaton satisfy such a window parity objective can be done in polynomial space, and that the corresponding timed games can be solved in exponential time.
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs
TLDR
It is shown that the characteristics of parity games with costs are vastly different when asking for strategies realizing the minimal such bound, and that playing optimally is as hard as winning, both in terms of complexity and memory.
Timed Games with Bounded Window Parity Objectives
TLDR
It is shown that verification of bounded timed window parity objectives in timed automata can be performed in polynomial space, and that timed games with these objectives can be solved in exponential time, even for multi-objective extensions.
Games Where You Can Play Optimally with Arena-Independent Finite Memory
TLDR
A complete characterization of preference relations that admit optimal strategies using arena-independent finite memory is established, generalizing the work of Gimbert and Zielonka to the finite-memory case and proving an equivalent to their celebrated corollary.
Games Where You Can Play Optimally with Finite Memory
TLDR
A complete characterization of preference relations that admit optimal strategies using arena-independent finite memory is established, generalizing the work of Gimbert and Zielonka to the finite-memory case and proving an equivalent to their celebrated corollary.
Arena-Independent Finite-Memory Determinacy in Stochastic Games
TLDR
These contributions further the understanding of arena-independent finite-memory (AIFM) determinacy, i.e., the study of objectives for which memory is needed, but in a way that only depends on limited parameters of the game graphs.
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
TLDR
This work studies two-player turn-based stochastic games and provides a complete taxonomy of the classes of finite-memory strategies obtained by varying which of the three aforementioned components are randomised.
Concurrent games and semi-random determinacy
TLDR
Consider concurrent, infinite duration, two-player win/lose games played on graphs and the non-existence of Player 1 winning strategies from all vertices is equivalent to the existence of Player 2 stochastic strategies winning almost surely from all Vertices.
Quantitative Reductions and Vertex-Ranked Infinite Games
TLDR
This work provides quantitative reductions of quantitative request-response games to vertex-ranked games, thus showing ExpTime-completeness of solving the former games and lays the foundation for a general study of fault-resilient strategies for more complex winning conditions.
Extending finite-memory determinacy by Boolean combination of winning conditions
TLDR
This work establishes general conditions under which FM strategies suffice to play optimally, even in a broad multi-objective setting, and shows that the framework encompasses important classes of games from the literature, and permits to go further, using a unified approach.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs
TLDR
It is shown that the characteristics of parity games with costs are vastly different when asking for strategies realizing the minimal such bound, and that playing optimally is as hard as winning, both in terms of complexity and memory.
Looking at mean-payoff and total-payoff through windows
Generalized Parity Games
TLDR
This work considers games where the winning conditions are disjunctions (or dually, conjunctions) of parity conditions; it shows that these games retain the computational complexity of Rabin and Streett conditions, and proves (co-)NP-hardness for the special case of a conjunction/disjunction of two parity conditions.
Small Progress Measures for Solving Parity Games
TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
Parity and Streett Games with Costs
TLDR
Two winning conditions are introduced, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses, which generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions.
Strategy synthesis for multi-dimensional quantitative objectives
TLDR
A tight exponential bound on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives is shown and it is shown that for one-dimension mean- payoff parity games, randomized memoryless strategies are as powerful as their pure finite- memory counterparts.
Deciding the Winner in Parity Games is in UP \cap co-Up
The surprizing complexity of generalized reachability games
TLDR
It is proved that deciding the winner in such games is $\PSPACE$-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter, and it is shown that bounding the size of the reachability sets gives two natural subclasses where deciding thewinner can be done efficiently.
Solving parity games in big steps
  • S. Schewe
  • Computer Science
    J. Comput. Syst. Sci.
  • 2007
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
  • W. Zielonka
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1998
...
...