Journal of Computer and System Sciences
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Modern Computer Algebra
A Game Theoretic Approach to the Analysis of Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Introducing reactive Kripke semantics and arc accessibility
Pillars of computer science
Learning and teaching as a game: a sabotage approach
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
| Hi-index | 0.00 |
We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over graphs is considered, where a “Runner” starts from a vertex u and seeks to reach some vertex in a target set F while, after each move, the adversary “Blocker” deletes one edge. Extending work by Löding and Rohde (who showed PSpace-completeness of this reachability problem), we consider the randomized case (a “game against nature”) in which the deleted edges are chosen at random, each existing edge with the same probability. In this much weaker model, we show that, for any probability p and ε0, the following problem is again PSpace-complete: Given a game graph with u and F and a probability p′ in the interval [p−ε,p+ε], is there a strategy for Runner to reach F with probability ≥p′? Our result extends the PSpace-completeness of Papadimitriou’s “dynamic graph reliability”; there, the probabilities of edge failures may depend both on the edge and on the current position of Runner.