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

Dávid Szeszlér ()
Additional contact information
Dávid Szeszlér: Budapest University of Technology and Economics

Journal of Combinatorial Optimization, 2019, vol. 38, issue 1, No 4, 72-85

Abstract: 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; 90B25; 91A80; 05C40 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0366-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0366-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0366-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().