Paper Info
Title
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Abstract
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost incurred between occurrences of odd colors and the next occurrence of a larger even one. Such games quantitatively extend parity games while retaining most of their attractive properties, i.e, determining the winner is in NP and co-NP and one player has positional winning strategies. We show that the characteristics of parity games with costs are vastly different when asking for strategies realizing the minimal such bound: The solution problem becomes PSPACE-complete and exponential memory is both necessary in general and always sufficient. Thus, solving and playing parity games with costs optimally is harder than just winning them. Moreover, we show that the tradeoff between the memory size and the realized bound is gradual in general. All these results hold true for both a unary and binary encoding of costs. Moreover, we investigate Streett games with costs. Here, playing optimally is as hard as winning, both in terms of complexity and memory.
Year
DOI
Venue
2016
10.23638/LMCS-13(3:29)2017
LOGICAL METHODS IN COMPUTER SCIENCE
Keywords
DocType
Volume
Parity Games with Costs,Optimal Strategies,Memory Requirements,Tradeoffs
Conference
13
Issue
ISSN
Citations 
3
1860-5974
2
PageRank 
References 
Authors
0.39
4
2
Name
Order
Citations
PageRank
Alexander Weinert172.22
Martin Zimmermann 000223510.88