Solving the Sabotage Game Is PSPACE-Hard

@inproceedings{Lding2003SolvingTS,
  title={Solving the Sabotage Game Is PSPACE-Hard},
  author={Christof L{\"o}ding and Philipp Rohde},
  booktitle={MFCS},
  year={2003}
}
We consider the sabotage game presented by van Benthem in an essay on the occasion of Jörg Siekmann’s 60th birthday. In this game one player moves along the edges of a finite, directed or undirected multi-graph and the other player takes out a link after each step. There are several algorithmic tasks over graphs which can be considered as winning conditions for this game, for example reachability, Hamilton path or complete search. As the game definitely ends after at most the number of edges… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

editors

Johan van Benthem. An essay on sabotage, obstruction. In D. Hutter, S. Werner
Festschrift in Honour of Prof. Joerg Siekmann, Lecture Notes in Artificial Intelligence. Springer-Verlag, • 2002
View 5 Excerpts
Highly Influenced

An Essay on Sabotage and Obstruction

Mechanizing Mathematical Reasoning • 2005

simultaneously: CoWeb architecture and functionality

∗ M. Gebhardt S. Jacobs
Jahresbericht • 1996

IEEE Transactions on Circuit Theory CT-17

John Bruno, Louis Weinberg. A constructive graph-theoretic solution game
1:74–81, • 1970
View 1 Excerpt

Similar Papers

Loading similar papers…