Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Online computation and competitive analysis
Online computation and competitive analysis
Information and Computation - Special issue on FLOC '96
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
A Fully Abstract Model for Graph-Interpreted Temporal Logic
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of Logic and Computation
Dynamic Complexity Theory Revisited
Theory of Computing Systems
A Game Theoretic Approach to the Analysis of Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey on networking games in telecommunications
Computers and Operations Research
Graph Transformation in a Nutshell
Electronic Notes in Theoretical Computer Science (ENTCS)
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Learning and teaching as a game: a sabotage approach
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
| Hi-index | 5.23 |
A game-theoretic model for the study of dynamic networks is proposed and analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources. The corresponding two-player game is played between ''Destructor'' (who can delete nodes) and ''Constructor'' (who can restore or even create nodes under certain conditions). We also include the feature of information flow by allowing Constructor to change labels of adjacent nodes. As an objective for Constructor the network property to be connected is considered, either as a safety condition or as a reachability condition (in the latter case starting from a non-connected network). We show under which conditions the solvability of the corresponding games for Constructor is decidable, and in this case obtain upper and lower complexity bounds, as well as algorithms derived from winning strategies. Due to the asymmetry between the players, safety and reachability objectives are not dual to each other and are treated separately.