Connectivity games over dynamic networks
From MaRDI portal
Publication:391110
DOI10.1016/j.tcs.2012.12.001zbMath1294.68035OpenAlexW2120568468MaRDI QIDQ391110
Frank G. Radmacher, Wolfgang Thomas, Sten Grüner
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.001
2-person games (91A05) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items
Sabotage Modal Logic: Some Model and Proof Theoretic Aspects, Connectivity games over dynamic networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity games over dynamic networks
- The complexity of two-player games of incomplete information
- Online algorithms. The state of the art
- Online algorithms: a survey
- Module checking
- Automata, logics, and infinite games. A guide to current research
- A survey on networking games in telecommunications
- Dynamic complexity theory revisited
- A Game Theoretic Approach to the Analysis of Dynamic Networks
- A Game-Theoretic Approach to Routing under Adversarial Conditions
- A Reduction from DLP to PDL
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Infinite State Model-Checking of Propositional Dynamic Logics
- Modal Logics for Preferences and Cooperation: Expressivity and Complexity
- Algorithms and Theory of Computation Handbook, Volume 1
- Learning and Teaching as a Game: A Sabotage Approach
- Handbook of Graph Grammars and Computing by Graph Transformation
- On the synthesis of strategies in infinite games
- GETGRATS
- Foundations of Software Science and Computation Structures
- Mathematical Foundations of Computer Science 2003
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Mechanizing Mathematical Reasoning
- CONCUR 2003 - Concurrency Theory
- Lower bounds for multiplayer noncooperative games of incomplete information
