Advertisement

Hitting a path: a generalization of weighted connectivity via game theory

  • Dávid SzeszlérEmail author
Article

Abstract

Applying game-theoretical tools for measuring the reliability of a network has become very common. The basic idea is very natural: analyzing an appropriately defined attacker–defender game might give rise to a relevant security metric. In this paper we consider a very natural set of games: the Defender chooses a path P between two given nodes and the Attacker chooses a network element a (that is, an edge or a node). In all cases, the Attacker has to pay a given cost of attack c(a); if, however, a is on P then he also gains a given profit of d(a). We determine the value of various versions of this game and show that the thus arising reliability metrics provide a generalization of weighted connectivity of graphs. We also prove that the values of the games and optimum mixed strategies for both players can be computed in strongly polynomial time.

Keywords

Network reliability Game theory Connectivity 

Mathematics Subject Classification

90B25 91A80 05C40 

References

  1. Alpcan T, Başar T (2010) Network security: a decision and game-theoretic approach. Cambridge University Press, CambridgezbMATHGoogle Scholar
  2. Baïou M, Barahona F (2018) Faster algorithms for security games on matroids. Algorithmica.  https://doi.org/10.1007/s00453-018-0466-x
  3. Calinescu G, Kapoor S, Quinn M, Shin J (2012) Adversary games in secure/reliable network routing. In: Proceedings of game theory for networks: second international ICST conference, GameNets 2011, Shanghai, China. Springer, Berlin, pp 249-264Google Scholar
  4. Cohen E, Megiddo N (1994) Algorithms and complexity analysis for some flow problems. Algorithmica 11(3):320–340MathSciNetCrossRefGoogle Scholar
  5. Cunningham WH (1985) Optimal attack and reinforcement of a network. J ACM (JACM) 32(3):549–561MathSciNetCrossRefGoogle Scholar
  6. Gueye A, Walrand J C, Anantharam V (2010) Design of network topology in an adversarial environment. In: Proceedings of the 1st international conference on decision and game theory for security, GameSec10, Berlin, Germany, pp 1–20Google Scholar
  7. Gueye A, Walrand J C, Anantharam V (2011) A network topology design game: how to choose communication links in an adversarial environment. In: Proceedings of the 2nd international ICST conference on game theory for networks, GameNets, vol 11Google Scholar
  8. Gusfield D (1983) Connectivity and edge-disjoint spanning trees. Inf Process Lett 16(2):87–89MathSciNetCrossRefGoogle Scholar
  9. Han Z (2012) Game theory in wireless and communication networks: theory, models, and applications. Cambridge University Press, CambridgezbMATHGoogle Scholar
  10. Laszka A, Szeszlér D (2015) Hide and seek in digital communication: the steganography game. In: Proceedings 9th Hungarian–Japanese symposium on discrete mathematics and its applications, Fukuoka, Japan, pp 126–136Google Scholar
  11. Machado R, Tekinay S (2008) A survey of game-theoretic approaches in wireless sensor networks. Comput Netw 52(16):3047–3061CrossRefGoogle Scholar
  12. Manshaei MH, Zhu Q, Alpcan T, Bacsar T, Hubaux JP (2013) Game theory meets network security and privacy. ACM Comput Surv (CSUR) 45(3):25CrossRefGoogle Scholar
  13. Matoušek J, Gärtner B (2007) Understanding and using linear programming. Springer, BerlinzbMATHGoogle Scholar
  14. Neumann JV (1928) Zur Theorie der Gesellschaftsspiele. Math Ann 100(1):295–320Google Scholar
  15. Radzik T (1993) Parametric flows, weighted means of cuts and fractional combinatorial optimization. In: Pardalos P (ed) Complexity in numerical optimization. World Scientific Co., Singapore, pp 351–386CrossRefGoogle Scholar
  16. Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency, algorithms and combinatorics, vol 24. Springer, BerlinzbMATHGoogle Scholar
  17. Szeszlér D (2017) Security games on matroids. Math Program 161(1):347–364MathSciNetCrossRefGoogle Scholar
  18. Szeszlér D (2017) Measuring graph robustness via game theory. In: Proceedings 10th Japanese–Hungarian symposium on discrete mathematics and its applications, Budapest, pp 473–482Google Scholar
  19. Tambe M (2012) Security and game theory: algorithms, deployed systems, lessons learned. Cambridge University Press, New YorkzbMATHGoogle Scholar
  20. Washburn A, Wood K (1995) Two-person zero-sum games for network interdiction. Oper Res 43(2):243–251MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and Information TheoryBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations