Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2021
    In:  Operations Research Vol. 69, No. 2 ( 2021-03), p. 486-508
    In: Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 69, No. 2 ( 2021-03), p. 486-508
    Abstract: In recent years, a lot of effort has been dedicated to develop strategies to defend networks against possible cascade failures or malicious viral attacks. On the one hand, network safety is investigated from a preventive perspective. On the other hand, blocking models have been proposed for scenarios in which the attack has already taken place causing a harmful spreading throughout the network. In this work, we combine these two perspectives. More precisely, following the framework defender–attacker–defender, we consider a model of prevention, attack, and damage containment using a three-stage, zero-sum game. The defender is not only able to adopt preventive strategies, but also to defend the network after an attack takes place. Assuming that the attacker acts optimally, we compute a defensive strategy for the first stage that minimizes the total damage to the network in the end of the third stage. Our contribution consists of considering this problem as a trilevel mixed-integer program and designing an exact algorithm for it based on tools developed for multilevel programming.
    Type of Medium: Online Resource
    ISSN: 0030-364X , 1526-5463
    RVK:
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2021
    detail.hit.zdb_id: 2019440-7
    detail.hit.zdb_id: 123389-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages