Connectivity games over dynamic networks

DOI10.1016/J.TCS.2012.12.001MaRDI QIDQ391110zbMATH OpenOpenAlexFDO

Authors Sten Grüner, Frank G. Radmacher, Wolfgang Thomas

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

zbMATH Keywords

dynamic networksfault-tolerant systemsinfinite gamesconnectivity games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Recommendations

• Connectivity games over dynamic networks
• A game theoretic approach to the analysis of dynamic networks
• Quantitative games under failures
• scientific article; zbMATH DE number 2081020
• A note on connectivity and stability in dynamic network formation

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2038781 (Why is no real title available?)
• scientific article; zbMATH DE number 1504838 (Why is no real title available?)
• scientific article; zbMATH DE number 2086372 (Why is no real title available?)
• 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
• A game theoretic approach to the analysis of dynamic networks
• A survey on networking games in telecommunications
• Algorithms and theory of computation handbook. General concepts and techniques.
• Automata, logics, and infinite games. A guide to current research
• Connectivity games over dynamic networks
• Connectivity games over dynamic networks
• Dynamic complexity theory revisited
• Foundations of Software Science and Computation Structures
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Handbook of Graph Grammars and Computing by Graph Transformation
• Infinite State Model-Checking of Propositional Dynamic Logics
• Learning and teaching as a game: A sabotage approach
• Lower bounds for multiplayer noncooperative games of incomplete information
• Mathematical Foundations of Computer Science 2003
• Mechanizing Mathematical Reasoning
• Modal Logics for Preferences and Cooperation: Expressivity and Complexity
• Module checking
• On the synthesis of strategies in infinite games
• Online algorithms. The state of the art
• Online algorithms: a survey
• Playing games with boxes and diamonds.
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Solution of Church's problem: a tutorial
• The complexity of two-player games of incomplete information

Cited in

(7)

• Connectivity games over dynamic networks
• Connectivity games over dynamic networks
• Solution complexity of local variants of sabotage game
• Sabotage modal logic: some model and proof theoretic aspects
• A game theoretic approach to the analysis of dynamic networks
• Games of Connectivity
• Hitting a path: a generalization of weighted connectivity via game theory

This page was built for publication: Connectivity games over dynamic networks

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