A Game Theoretic Approach to the Analysis of Dynamic Networks

DOI10.1016/j.entcs.2008.02.010zbMath1277.68026OpenAlexW2009726592MaRDI QIDQ2864354

Frank G. Radmacher, Wolfgang Thomas

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.02.010

zbMATH Keywords

game theoryadaptive systemsmodel-checkingdynamic networksdynamic graph problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Sabotage Modal Logic: Some Model and Proof Theoretic Aspects ⋮ A Dynamic Algorithm for Reachability Games Played on Trees ⋮ Connectivity games over dynamic networks ⋮ Moving in a network under random failures: a complexity analysis ⋮ On sabotage games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dynamic complexity of transitive closure is in DynTC\(^{0}\).
• Automata, logics, and infinite games. A guide to current research
• A Reduction from DLP to PDL
• On the Complexity of Reasoning About Dynamic Policies
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Handbook of Graph Grammars and Computing by Graph Transformation
• GETGRATS
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• Mathematical Foundations of Computer Science 2003
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Mechanizing Mathematical Reasoning
• A fully dynamic algorithm for maintaining the transitive closure