2008
DOI: 10.1007/978-0-387-77247-9_24
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for Network Interdiction and Fortification Games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
31
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 53 publications
(34 citation statements)
references
References 97 publications
0
31
0
Order By: Relevance
“…Cr fṽ rg dr 0 Z 1 Cr fṽ rg dr: (22) We assume in this research thatṽ is a trapezoidal fuzzy number de ned by four constant points asṽ = (v (1) ; v (2) ; v (3) ; v (4) ). According to Expressions (23) and (24), the corresponding credibility measures and expected value ofṽ are computed as follows:…”
Section: The Proposed Credibility-based Fuzzy Chance Constrained Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Cr fṽ rg dr 0 Z 1 Cr fṽ rg dr: (22) We assume in this research thatṽ is a trapezoidal fuzzy number de ned by four constant points asṽ = (v (1) ; v (2) ; v (3) ; v (4) ). According to Expressions (23) and (24), the corresponding credibility measures and expected value ofṽ are computed as follows:…”
Section: The Proposed Credibility-based Fuzzy Chance Constrained Modelmentioning
confidence: 99%
“…Cr fṽrg , r (2 2 )v (3) +(2 1)v (4) ; (26) Cr fṽrg , r (2 1)v (1) +(2 2 )v (2) : (27) To tackle uncertainty in the proposed interdiction model, all the parameters are presumed to be independent trapezoidal fuzzy numbers. To convert chance constraints to equivalent crisp constraints, we can directly apply Expressions (26) and (27).…”
Section: The Proposed Credibility-based Fuzzy Chance Constrained Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…An attacker attacks N resources (e.g. launches a distributed denial of service attack on nodes, servers, etc., see [15]) by sending streams of harmful packets to resource i at a rate i w (where 1, , i N =  and i i w ∑ is constant). A defender assigns a defense mechanism of intensity i  (e.g.…”
Section: Interdictionmentioning
confidence: 99%
“…In particular, when one party is responsible for choosing the paths and/or flows along which information or products are transported in the presence of full or partial disruptions to the nodes or links, this is commonly referred to as an interdiction game [19], [20]. Typically, interdiction games are multistage, with players acting in turn based on observed changes to the network.…”
Section: Introductionmentioning
confidence: 99%