A game-theoretic approach to routing under adversarial conditions

IFIP Advances in Information and Communication Technology

Volumn 323 AICT, Issue , 2010, Pages 355-370

  Gross, James ^a   Radmacher, Frank G ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC SOLUTIONS; COGNITIVE RADIO NETWORK; GAME-THEORETIC; INFINITE TWO-PLAYER GAME; NETWORK PACKETS; NON TERMINATIONS; PRIMARY SYSTEMS; ROUTING PROBLEMS;

COGNITIVE RADIO; COMPUTER SCIENCE; GAME THEORY;

QUALITY OF SERVICE;

EID: 84879217328     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-15240-5_26     Document Type: Article

References (19)

1. Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosén, A., Shavit, N.: Slide - the key to polynomial end-to-end communication. Journal of Algorithms 22(1), 158-186 (1997)
2. Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of SODA, pp. 771-780 (2003)
3. Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting in adversarial systems: Routing and admission control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1153-1168. Springer, Heidelberg (2003)
4. Awerbuch, B., Mansour, Y., Shavit, N.: Polynomial end-to-end communication (extended abstract). In: Proceedings of FOCS, pp. 358-363. IEEE, Los Alamitos (1989)
5. van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol. 2605, pp. 268-276. Springer, Heidelberg (2005)
6. Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
7. Gao, L., Wang, X.: A game approach for multi-channel allocation in multi-hop wireless networks. In: Proceedings of MobiHoc, pp. 303-312. ACM, New York (2008)
8. Gierasimczuk, N., Kurzen, L., Velázquez-Quesada, F.R.: Learning and teaching as a game: A sabotage approach. In: He, X., Horty, J., Pacuit, E. (eds.) LORI 2009. LNCS, vol. 5834, pp. 119-132. Springer, Heidelberg (2009)
9. Grädel, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
10. Horn, F., Thomas, W., Wallmeier, N.: Optimal strategy synthesis in request-response games. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 361-373. Springer, Heidelberg (2008)
11. Klein, D., Radmacher, F.G., Thomas, W.: The complexity of reachability in randomized sabotage games. In: Arbab, F., Sirjani, M. (eds.) Fundamentals of Software Engineering. LNCS, vol. 5961, pp. 162-177. Springer, Heidelberg (2010)
12. Löding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 302-313. Springer, Heidelberg (2003)
13. Löding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 531-540. Springer, Heidelberg (2003)
14. Radmacher, F.G., Thomas, W.: A game theoretic approach to the analysis of dynamic networks. In: Proceedings of VerAS. Electronic Notes in Theoretical Computer Science, vol. 200(2), pp. 21-37. Elsevier, Amsterdam (2008)
15. Rohde, P.: Moving in a crumbling network: The balanced case. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 310-324. Springer, Heidelberg (2004)
16. Rohde, P.: On Games and Logics over Dynamically Changing Structures. Ph.D. thesis, RWTH Aachen (2005)
17. Shiang, H.P., van der Schaar, M.: Distributed resource management in multihop cognitive radio networks for delay-sensitive transmission. IEEE Transactions on Vehicular Technology 58(2), 941-953 (2009)
18. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (1995)
19. Xin, C., Ma, L., Shen, C.C.: A path-centric channel assignment framework for cognitive radio wireless networks. Mobile Networks and Applications 13(5), 463-476 (2008)