The complexity of reachability in randomized sabotage games

DOI10.1007/978-3-642-11623-0_9MaRDI QIDQ3400919zbMATH OpenOpenAlexFDO

Authors

Publication date 28 January 2010

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11623-0_9

zbMATH Keywords

reachabilityfault-tolerant systemsgamesprobabilistic systems

Mathematics Subject Classification ID

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) Games involving graphs (91A43)

Recommendations

• Moving in a network under random failures: a complexity analysis
• Mathematical Foundations of Computer Science 2003
• Quantitative games under failures
• On sabotage games
• Concurrent reachability games

Cited in

(6)

• Mathematical Foundations of Computer Science 2003
• Moving in a network under random failures: a complexity analysis
• Restricted Power - Computational Complexity Results for Strategic Defense Games
• On sabotage games
• Quantitative games under failures
• On the Complexity of Counter Reachability Games

This page was built for publication: The complexity of reachability in randomized sabotage games

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