License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2018.17
URN: urn:nbn:de:0030-drops-88082
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8808/
de Haan, Ronald ;
Wolf, Petra
Restricted Power - Computational Complexity Results for Strategic Defense Games
Abstract
We study the game Greedy Spiders, a two-player strategic defense game, on planar graphs and show PSPACE-completeness for the problem of deciding whether one player has a winning strategy for a given instance of the game. We also generalize our results in metatheorems, which consider a large set of strategic defense games. We achieve more detailed complexity results by restricting the possible strategies of one of the players, which leads us to Sigma^p_2- and Pi^p_2-hardness results.
BibTeX - Entry
@InProceedings{dehaan_et_al:LIPIcs:2018:8808,
author = {Ronald de Haan and Petra Wolf},
title = {{Restricted Power - Computational Complexity Results for Strategic Defense Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8808},
URN = {urn:nbn:de:0030-drops-88082},
doi = {10.4230/LIPIcs.FUN.2018.17},
annote = {Keywords: Computational complexity, generalized games, metatheorems}
}
|
Keywords: |
|
Computational complexity, generalized games, metatheorems |
|
Collection: |
|
9th International Conference on Fun with Algorithms (FUN 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.06.2018 |
