Abstract
We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph 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 classes of graphs. We prove or disprove that the usual powerset construction for eliminating partial information preserves boundedness of the graph complexity. For the case where the partial information is unbounded we prove that the construction does not preserve boundedness of any measure we consider. We also prove that the strategy problem is Exptime-hard on graphs with directed path-width at most 2 and Pspace-complete on acyclic graphs. For games with bounded partial information we obtain that the powerset construction, while neither preserving boundedness of entanglement nor of (undirected) tree-width, does preserve boundedness of directed path-width. Therefore, parity games with bounded partial information, played on graphs with bounded directed path-width can be solved in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barát, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22, 161–172 (2006)
Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524–536. Springer, Heidelberg (2006)
Berwanger, D., et al.: Strategy Construction for Parity Games with Imperfect Information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 325–339. Springer, Heidelberg (2008)
Berwanger, D., Grädel, E.: Entanglement – a measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 209–223. Springer, Heidelberg (2005)
Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, pp. 193–242. Elsevier, Amsterdam (1990)
Grädel, E., Kaiser, Ł., Rabinovich, R.: Directed Graphs of Entanglement Two. In: Gȩbala, M. (ed.) FCT 2009. LNCS, vol. 5699, pp. 169–181. Springer, Heidelberg (2009)
Hunter, P.: Losing the +1 or directed path-width games are monotone (2006), http://www.comlab.ox.ac.uk/people/paul.hunter/papers/losing.pdf
Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: SODA, pp. 637–644 (2007)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B 82(1), 138–154 (2001)
Jurdziński, M.: Games for Verification: Algorithmic Issues. PhD thesis, University of Aarhus (2000)
Kreutzer, S., Ordyniak, S.: Digraph Decompositions and Monotonicity in Digraph Searching. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 336–347. Springer, Heidelberg (2008)
Obdržálek, J.: Algorithmic Analysis of Parity Games. PhD thesis, School of Informatics, University of Edinburgh (2006)
Obdržálek, J.: Dag-width: connectivity measure for directed graphs. In: SODA, pp. 814–821 (2006)
Puchala, B.: Infinite Two Player Games with Partial Information: Logic and Algorithms. Diploma Thesis, RWTH Aachen (2008)
Reif, J.H.: The Complexity of Two-player Games of Incomplete Information. JCSS 29, 274–301 (1984)
Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Ser. B 58(1), 22–33 (1993)
Thomas, W.: On the Synthesis of Strategies in Infinite Games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puchala, B., Rabinovich, R. (2010). Parity Games with Partial Information Played on Graphs of Bounded Complexity. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-15155-2_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15154-5
Online ISBN: 978-3-642-15155-2
eBook Packages: Computer ScienceComputer Science (R0)