Moving in a network under random failures: a complexity analysis

DOI10.1016/J.SCICO.2010.05.009zbMath1242.68031OpenAlexW2108590202MaRDI QIDQ433350

J. Herrera, H. S. Yoon

Publication date: 13 July 2012

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2010.05.009

zbMATH Keywords

fault-tolerant systemsprobabilistic systemssabotage games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

On sabotage games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games against nature
• A Game Theoretic Approach to the Analysis of Dynamic Networks
• The Complexity of Reachability in Randomized Sabotage Games
• Learning and Teaching as a Game: A Sabotage Approach
• The complexity of probabilistic verification
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• Mathematical Foundations of Computer Science 2003
• Introducing Reactive Kripke Semantics and Arc Accessibility
• Mechanizing Mathematical Reasoning
• Stochastic Boolean satisfiability

This page was built for publication: Moving in a network under random failures: a complexity analysis