A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded complexity. We consider several measures for the complexity of graphs and analyze in which cases, bounding the measure decreases the complexity of the strategy problem on the corresponding class of graphs. We prove or disprove that the usual powerset construction for eliminating partial information preserves boundedness of the graph complexity. For the case wheredoi:10.1007/978-3-642-15155-2_53 fatcat:tqi43uqoxzhejeddkdy2bfsaya