Moving in a network under random failures: a complexity analysis

DOI10.1016/J.SCICO.2010.05.009MaRDI QIDQ433350zbMATH OpenOpenAlexFDO

Authors Dominik Klein, Frank G. Radmacher, Wolfgang Thomas

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

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

Recommendations

• The complexity of reachability in randomized sabotage games
• Quantitative games under failures
• Computer Science Logic
• Mathematical Foundations of Computer Science 2003

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A game theoretic approach to the analysis of dynamic networks
• Computer Science Logic
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Games against nature
• Introducing Reactive Kripke Semantics and Arc Accessibility
• Learning and teaching as a game: A sabotage approach
• Mathematical Foundations of Computer Science 2003
• Mechanizing Mathematical Reasoning
• Stochastic Boolean satisfiability
• The complexity of probabilistic verification
• The complexity of reachability in randomized sabotage games

Cited in

(6)

• Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks
• On sabotage games
• The complexity of reachability in randomized sabotage games
• Quantitative games under failures
• On a random walk survivability problem with arc failures and memory
• Computer Science Logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433350)