Connectivity games over dynamic networks

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.

[1]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[2]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[3]  Riccardo Pucella,et al.  Reasoning about Dynamic Policies , 2004, FoSSaCS.

[4]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[5]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[6]  Rajeev Alur,et al.  Playing Games with Boxes and Diamonds , 2003, CONCUR.

[7]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[8]  Markus Lohrey,et al.  Infinite State Model-Checking of Propositional Dynamic Logics , 2006, CSL.

[9]  Thomas Schwentick,et al.  Dynamic Complexity Theory Revisited , 2005, Theory of Computing Systems.

[10]  Andrea Corradini.  GETGRATS: A summary of scientific results (with annotated bibliography) , 2001, Electron. Notes Theor. Comput. Sci..

[11]  Wolfgang Thomas,et al.  Moving in a network under random failures: A complexity analysis , 2012, Sci. Comput. Program..

[12]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[13]  Christian Scheideler,et al.  Anycasting in Adversarial Systems: Routing and Admission Control , 2003, ICALP.

[14]  James Gross,et al.  A Game-Theoretic Approach to Routing under Adversarial Conditions , 2010, IFIP TCS.

[15]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[16]  Reiko Heckel,et al.  A Fully Abstract Model for Graph-Interpreted Temporal Logic , 1998, TAGT.

[17]  Reiko Heckel,et al.  Graph Transformation in a Nutshell , 2006, FoVMT.

[18]  Uri Zwick,et al.  A fully dynamic reachability algorithm for directed graphs with an almost linear update time , 2004, STOC '04.

[19]  Nina Gierasimczuk,et al.  Learning and Teaching as a Game: A Sabotage Approach , 2009, LORI.

[20]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[21]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[22]  Stéphane Demri,et al.  A Reduction from DLP to PDL , 2005, J. Log. Comput..

[23]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[24]  Philipp Rohde,et al.  On games and logics over dynamically changing structures , 2005 .

[25]  Christof Löding,et al.  Solving the Sabotage Game Is PSPACE-Hard , 2003, MFCS.

[26]  L. Kurzen.  Complexity in interaction , 2011 .

[27]  Wolfgang Thomas,et al.  A Game Theoretic Approach to the Analysis of Dynamic Networks , 2008, VerAS@TPHOLs.

[28]  Johan van Benthem,et al.  An Essay on Sabotage and Obstruction , 2005, Mechanizing Mathematical Reasoning.

[29]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[30]  David Eppstein,et al.  Dynamic graph algorithms , 2010 .

[31]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[32]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[33]  Christian Scheideler.  Models and Techniques for Communication in Dynamic Networks , 2002, STACS.

[34]  Dieter Hutter,et al.  Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday , 2005, Mechanizing Mathematical Reasoning.