1 / 52

Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information

Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information. Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi- Cin Lin Advisor: Frank, Yeong -Sung Lin . Agenda. Introduction Problem Formulation Stacklberg Equilibrium Approach Apply Robust Game to Real Data

gayle
Download Presentation

Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Robust Allocation of a Defensive Budget Consideringan Attacker’s Private Information Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi-Cin Lin Advisor:Frank, Yeong-Sung Lin

  2. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  3. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  4. Introduction Terrorist attacks

  5. Introduction

  6. Introduction • Deciding how, where, and when to allocate resources to protect critical infrastructure is a difficult problem, specifically when we have no accurate estimation about the attacker’s attributes Defender’s private information Common knowledge Attacker’s private information

  7. Introduction • Uncertainty • Precise estimation of the probability of an attack • Exact assessment of the attacker’seffort • Identification of actual targets and the attacker’s valuation of those targets 1 2 2 5 1 3

  8. Introduction • There are two principal methods proposed to address data uncertainty over the years: • Stochastic-optimization programming • Robust optimization

  9. Introduction • Stochastic-optimization programming • Assuming different scenarios for data to occur with different probabilities • Optimize the expected value of some objective function • Difficulties with such an approach are • Knowing the exact distribution for the data • Computational challenges

  10. Introduction • Robust optimization • Optimize the worst-case performance of the system

  11. Introduction • We propose a robust-optimization game-theoretical approach to model the uncertainty in attacker’s attributes where uncertainty is characterized on bounded intervals based on the attacker’s target valuation.

  12. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  13. Problem Formulation • Assumption • The attacker could attack at most one target • In the sequential game, some targets may be left undefended in equilibrium

  14. Problem Formulation

  15. Problem Formulation- Damage Function • Damage Function Specifications: To define the player’s optimization problem, let us specify a damage function with the following properties- and are twice differentiable with respect to the defender’s and attacker’s effort , where 0,

  16. Problem Formulation- Damage Function • Let us define the expected damage from the standpoint of the defender and the attacker, respectively, as follows:

  17. Problem Formulation- Defender’s Optimization Model • Defender’s Optimization Model The defender seeks to find the optimal defensive resource allocation, , which minimizes the total expected damage and the to tal defensive investment costs

  18. Problem Formulation- Defender’s Optimization Model • The defender wishes to minimize her defense costs and expected losses

  19. Problem Formulation- Attacker’s Optimization Model • We assume that the strategic attacker concentrates his attack budget to launch an attack on only one target, the target that maximizes his payoffs. Attacker’s utility

  20. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  21. Stacklberg Equilibrium Approach- Attacker’s Best Response • The concept in this part is based on the work by Zhuang and Bier [19] • The defender employs the attacker’s best response to estimate the attacker’s effort

  22. Stacklberg Equilibrium Approach- Attacker’s Best Response • Satisfying the optimality condition • Yields the attacker’s best response as follows is the least possible level of defense required to deter an attack on target

  23. Stacklberg Equilibrium Approach- Attacker’s Best Response • Satisfying the optimality condition • Yields the attacker’s best response as follows

  24. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • We need first extract the attacker’s best response function (7) and then plug it into the defender’s optimization problem (3)–(5) to obtain her best response.

  25. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • To satisfy the optimality condition, first we need to relax the budget constraint. The common way to deal with such a condition is to penalize the objective function by where is the Lagrange multiplier

  26. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • The Lagrangian function might be defined as follows: • Lagrangian function above gives the defender’s optimization problem as follows

  27. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • There is an optimal threshold for each target to be defended in equilibrium such that target i is defended if and only if the defender’s valuation of the target is greater than its optimal threshold

  28. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Before determining the defender’s robust-optimization equilibrium, let us assume that the defender can define a free-distribution interval for the attacker’s target valuation such that

  29. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Obstacle • The decision maker can extend the length of an interval to satisfy her belief about uncertain parameters.

  30. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Assuming , alternatively we can say which is centered at its nominal value and of half-length and of half-length , but its exact value is unknown

  31. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Assuming , alternatively we can say which is centered at its nominal value and of half-length and of half-length , but its exact value is unknown Half length= Nominal value=

  32. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium In particular, the defender may assume hervaluation of Target, which is , as the nominalvalue for the attacker’s valuation of target, which is, and then define the extreme bounds as a fractionof, for example, [0.5 , 1.5 ] Half length= Nominal value=

  33. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • We define the scaled deviation of the uncertain parameter from its nominal value as . It is clear that the scaled deviation takes on a value in [–1, 1]

  34. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Moreover, following Bertsimas and Sim, [33] we impose a constraint on uncertainty in the following way: the total scaled deviation of the uncertaintyparameters cannot exceed some threshold , calledthe budget of uncertainty, which leads to:

  35. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium (Nominal case) (Worst case) • Bertsimas and Sim[33] show that having the threshold varied in allows greater flexibility to build a robust model without excessively affecting the optimal cost.

  36. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • To define the defender’s robustoptimization equilibrium, consider the following set:

  37. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • We now use the concept of robust game theory proposed by Aghassi and Bertsimas [34] to obtain the robust-optimization equilibrium for the defender

  38. Stacklberg Equilibrium Approach- Defender Robust-Optimization Equilibrium • Defender’s robust-optimization problem as follows:

  39. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  40. Apply Robust Game to Real Data Total target valuation Total defensive budget

  41. Apply Robust Game to Real Data

  42. Apply Robust Game to Real Data

  43. Apply Robust Game to Real Data

  44. Agenda • Introduction • Problem Formulation • Stacklberg Equilibrium Approach • Apply Robust Game to Real Data • Conclusions

  45. Conclusions • In this article, we model the attacker’s attributes as uncertain parameters on bounded intervals, we proposed robust-optimization equilibrium for the defender, which gives her the flexibility to adjust the robustness of the solution to the level of her conservatism.

  46. Conclusions • By applying our proposed approach to real data, we studied the effect of the defender’s assumptions of the extreme bounds of the uncertain parameters on the robustness of her solution, and also the impacts of the effectiveness ratio of attack on the robustness of the defender’s solution.

More Related