The Complexity of Reachability in Randomized Sabotage Games

DOI10.1007/978-3-642-11623-0_9zbMath1274.68024OpenAlexW1530683668MaRDI QIDQ3400919

No author found.

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

reachabilitygamesfault-tolerant systemsprobabilistic systems

Mathematics Subject Classification ID

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)

Related Items (1)

Moving in a network under random failures: a complexity analysis

This page was built for publication: The Complexity of Reachability in Randomized Sabotage Games