Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnyi Analiz i Issledovanie Operatsii, 2019, Volume 26, Issue 4, Pages 16–33
DOI: https://doi.org/10.33048/daio.2019.26.663
(Mi da935)
 

A bilevel “Attacker–Defender” model to choosing the composition of attack means

V. L. Beresnevab, A. A. Melnikovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090, Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090, Novosibirsk, Russia
References:
Abstract: We consider a bilevel model of estimating the costs of the attacking party (the Attacker) for a successful attack of a given set of objects protected by the other party (the Defender). The Attacker and the Defender have multiple means to, correspondingly, attack and protect the objects, and the Attacker's costs depend on the Defender's means of protection. The model under consideration is based on the Stackelberg game, where the Attacker aims to successfully attack the objects with the least costs, while the Defender maximizes the Attacker's losses committing some limited budget. Formally, the “Attacker–Defender” model can be written as a bilevel mixed-integer program. The particularity of the problem is that the feasibility of the upper-level solution depends on all lower-level optimal solutions. To compute an optimal solution of the bilevel problem under study, we suggest some algorithm that splits the feasible region of the problem into subsets and reducing the problem to a sequence of bilevel subproblems. Specificity of feasible regions of these subproblems allows us to reduce them to common mixed-integer programming problems of two types. Bibliogr. 14.
Keywords: partition of the feasible region, bilevel subproblem, optimality condition.
Funding agency Grant number
Russian Science Foundation 17-01-00710
This research is supported by the Russian Science Foundation (Project 17–01–00710).
Received: 10.06.2019
Revised: 30.07.2019
Accepted: 28.08.2019
Document Type: Article
UDC: 519.8+518.25
Language: Russian
Citation: V. L. Beresnev, A. A. Melnikov, “A bilevel “Attacker–Defender” model to choosing the composition of attack means”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 16–33
Citation in format AMSBIB
\Bibitem{BerMel19}
\by V.~L.~Beresnev, A.~A.~Melnikov
\paper A bilevel ``Attacker--Defender'' model to~choosing~the~composition of attack means
\jour Diskretn. Anal. Issled. Oper.
\yr 2019
\vol 26
\issue 4
\pages 16--33
\mathnet{http://mi.mathnet.ru/da935}
\crossref{https://doi.org/10.33048/daio.2019.26.663}
Linking options:
  • https://www.mathnet.ru/eng/da935
  • https://www.mathnet.ru/eng/da/v26/i4/p16
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:260
    Full-text PDF :124
    References:20
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024