Connectivity games over dynamic networks

Theoretical Computer Science

Volumn 493, Issue , 2013, Pages 46-65

  Grüner, Sten ^a   Radmacher, Frank G ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Dynamic networks; Fault tolerant systems; Infinite games

Indexed keywords

RESTORATION;

CONNECTED NETWORKS; CONNECTIVITY GAMES; DYNAMIC NETWORK; FAULT TOLERANT SYSTEMS; GAME-THEORETIC MODEL; INFINITE GAME; INFORMATION FLOWS; NETWORK PROPERTIES;

GAME THEORY;

EID: 84879206931     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.12.001     Document Type: Conference Paper

References (42)

1. S. Grüner, Game theoretic analysis of dynamic networks, Diploma Thesis, RWTH Aachen. 2011.
2. J. Gross, F.G. Radmacher, and W. Thomas A game-theoretic approach to routing under adversarial conditions Proceedings of IFIP TCS IFIP Advances in Information and Communication Technology vol. 323 2010 Springer 355 370
3. J.H. Reif The complexity of two-player games of incomplete information Journal of Computer and System Sciences 29 1984 274 301
4. S.A zhar, G.L. Peterson, and J.H. Reif Lower bounds for multiplayer non-cooperative games of incomplete information Journal of Computers and Mathematics with Applications 41 2001 957 992
5. J. van Benthem An essay on sabotage and obstruction Mechanizing Mathematical Reasoning: Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday Lecture Notes in Computer Science vol. 2605 2005 Springer 268 276
6. C. Löding, P. Rohde, Solving the Sabotage Game is PSPACE-hard, Technical Report AIB-05-2003, RWTH Aachen, 2003.
7. C. Löding, and P. Rohde Solving the sabotage game is PSPACE-hard Proceedings of MFCS Lecture Notes in Computer Science vol. 2747 2003 Springer 531 540
8. P. Rohde, On Games and Logics over Dynamically Changing Structures, Ph.D. Thesis, RWTH Aachen. 2005.
9. D. Klein, F.G. Radmacher, and W. Thomas Moving in a network under random failures: A complexity analysis Science of Computer Programming 2010 Article in Press
10. N. Gierasimczuk, L. Kurzen, and F.R. Velázquez-Quesada Learning and teaching as a game: A sabotage approach Proceedings of LORI Lecture Notes in Computer Science vol. 5834 2009 Springer 119 132
11. L. Kurzen, Complexity in interaction, Ph.D. Thesis. 2011.
12. E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, and L. Wynter A survey on networking games in telecommunications Computers & Operations Research 33 2006 286 311
13. A. Fiat, and G.J. Woeginger Online Algorithms: The State of the Art Lecture Notes in Computer Science vol. 1442 1998 Springer
14. A. Borodin, and R. El-Yaniv Online Computation and Competitive Analysis 1998 Cambridge University Press
15. S. Albers Online algorithms: a survey Mathematical Programming 97 2003 3 26
16. R. Rajaraman Topology control and routing in ad hoc networks: a survey SIGACT News 33 2002 60 73
17. C. Scheideler Models and techniques for communication in dynamic networks Proceedings of STACS Lecture Notes in Computer Science vol. 2285 2002 Springer 27 49
18. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler Simple routing strategies for adversarial systems Proceedings of FOCS 2001 IEEE Computer Society 158 167
19. B. Awerbuch, A. Brinkmann, and C. Scheideler Anycasting in adversarial systems: Routing and admission control Proceedings of ICALP Lecture Notes in Computer Science vol. 2719 2003 Springer 1153 1168
20. C. Demetrescu, D. Eppstein, Z. Galil, and G.F. Italiano Dynamic graph algorithms M.J. Atallah, M. Blanton, Algorithms and Theory of Computation Handbook second ed. General Concepts and Techniques vol. 1 2010 CRC Press 9-1-9-28
21. J. Feigenbaum, and S. Kannan Dynamic graph algorithms K.H. Rosen, Handbook of Discrete and Combinatorial Mathematics 2000 CRC Press 1142 1151
22. J. Holm, K. de Lichtenberg, and M. Thorup Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity Journal of the ACM 48 2001 723 760
23. L. Roditty, and U. Zwick A fully dynamic reachability algorithm for directed graphs with an almost linear update time Proceedings of STOC 2004 ACM 184 191
24. V. Weber, and T. Schwentick Dynamic complexity theory revisited Theory of Computing Systems 40 2007 355 377
25. F.G. Radmacher, Games on dynamic networks: routing and connectivity, Ph.D. Thesis, RWTH Aachen. 2012.
26. R. Pucella, and V. Weissman Reasoning about dynamic policies Proceedings of FoSSaCS Lecture Notes in Computer Science vol. 2987 2004 Springer 453 467
27. S. Demri A reduction from DLP to PDL Journal of Logic and Computation 15 2005 767 785
28. S. Göller, and M. Lohrey Infinite state model-checking of propositional dynamic logics Proceedings of CSL Lecture Notes in Computer Science vol. 4207 2006 Springer 349 364
29. G. Rozenberg Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations 1997 World Scientific
30. A. Corradini GETGRATS: A summary of scientific results (with annotated bibliography) Proceedings of GETGRATS Closing Workshop Electronic Notes in Theoretical Computer Science vol. 51 2001 Elsevier 1 61
31. R. Heckel Graph transformation in a nutshell Proceedings of FoVMT Electronic Notes in Theoretical Computer Science vol. 148(1) 2006 Elsevier 187 198
32. F. Gadducci, R. Heckel, and M. Koch A fully abstract model for graph-interpreted temporal logic Proceedings of TAGT Lecture Notes in Computer Science vol. 1764 1998 Springer 310 322
33. O. Kupferman, M.Y. Vardi, and P. Wolper Module checking Information and Computation 164 2001 322 344
34. F.G. Radmacher, and W. Thomas A game theoretic approach to the analysis of dynamic networks Proceedings of VerAS Electronic Notes in Theoretical Computer Science vol. 200(2) 2008 Elsevier 21 37
35. S. Grüner, F.G. Radmacher, and W. Thomas Connectivity games over dynamic networks G. D'Agostino, S.L. Torre, Proceedings of GandALF Electronic Proceedings in Theoretical Computer Science vol. 54 2011 131 145
36. W. Thomas On the synthesis of strategies in infinite games Proceedings of STACS Lecture Notes in Computer Science vol. 900 1995 Springer 1 13
37. W. Thomas Solution of Church's Problem: A Tutorial Texts in Logic and Games vol. 4 2008 Amsterdam University Press 211 236
38. E. Grädel, W. Thomas, and T. Wilke Automata, Logics, and Infinite Games: A Guide to Current Research Lecture Notes in Computer Science vol. 2500 2002 Springer
39. C.H. Papadimitriou Computational Complexity 1994 Addison Wesley
40. A. Pnueli, and R. Rosner On the synthesis of an asynchronous reactive module Proceedings of ICALP Lecture Notes in Computer Science vol. 372 1989 Springer 652 671
41. R. Rosner, Modular synthesis of reactive systems, Ph.D. Thesis, The Weizmann Institute of Science. 1991.
42. R. Alur, S. La Torre, and P. Madhusudan Playing games with boxes and diamonds Proceedings of CONCUR Lecture Notes in Computer Science vol. 2761 2003 Springer 127 141