Problem 2: Strategic Defense There are N sites that need protection (number them 1 to N). Someone is going to pick one of them to attack, and you must pick one to protect. Suppose that the attacker is going to attack site i with probability q. You plan on selecting a site to protect, with probability p; of selecting site i. If you select the same site to protect that the attacker chooses to attack, you successfully defend that site. The choice of {q} and {p.} represent the attacker's and defender's strategy, respectively. 1) What is the probability that you successfully prevent the attack, given strategies (q.}, {p:}?? 2) If you knew {41,....qN} in advance, how should you choose {p,} to maximize the probability you successfully prevent an attack? 3) If you are the attacker, and you know that the defender is going to choose the best strategy they can to maximize the probability of preventing an attack, how should you choose your strategy to maximize the probability of a successful attack? 4) Questions 2.1, 2.2, 2.3 address the probability of a successful defense from the perspective of the attacker thinking about the best possible defender. Consider as well the perspective of the defender thinking about the best possible attacker. Re-do 2.1, 2.2, 2.3 from this perspective, then argue what the final' strategies for each player will be in this game. In the questions that follow, we imagine that a successful attack on site i will cost the defender C. 5) What is the expected or average cost of an attack, given strategies {q}, {p.}? 6) If you knew {q1,....qN} in advance, how should you choose {p.} to minimize the expected cost of an attack? 7) If you were the attacker, and knew that your opponent was trying to minimize the expected cost of your attack, how should you choose {q.} to maximize the expected cost of an attack? (Assume that your strategy is going to leak to your opponent.) 8) Questions 2.5, 2.6, 2.7 address the problem of the expected cost of an attack from the perspective of the attacker thinking about the best possible defender. Consider as well the the perspective of the defender thinking about the best possible attacker. Re-do 2.5, 2.6, 2.7 from this perspective, then argue what the 'final' strategies for each player will be in this game. Restricting ourselves to two sites, site A and site B, suppose that a successful attack on site i gives a reuward of R, to the attacker, at cost C, to the defender. if the attacker wants to marimize their erpected Bonus reward, and the defender wants to minimize their erpected cost, what strategies should they follow, and why? What if they had the opportunity to negotiate beforehand, how would that change things? Note, this will depend heavily on how {RA, Rp}, {CA,CB} relate to each other.
Problem 2: Strategic Defense There are N sites that need protection (number them 1 to N). Someone is going to pick one of them to attack, and you must pick one to protect. Suppose that the attacker is going to attack site i with probability q. You plan on selecting a site to protect, with probability p; of selecting site i. If you select the same site to protect that the attacker chooses to attack, you successfully defend that site. The choice of {q} and {p.} represent the attacker's and defender's strategy, respectively. 1) What is the probability that you successfully prevent the attack, given strategies (q.}, {p:}?? 2) If you knew {41,....qN} in advance, how should you choose {p,} to maximize the probability you successfully prevent an attack? 3) If you are the attacker, and you know that the defender is going to choose the best strategy they can to maximize the probability of preventing an attack, how should you choose your strategy to maximize the probability of a successful attack? 4) Questions 2.1, 2.2, 2.3 address the probability of a successful defense from the perspective of the attacker thinking about the best possible defender. Consider as well the perspective of the defender thinking about the best possible attacker. Re-do 2.1, 2.2, 2.3 from this perspective, then argue what the final' strategies for each player will be in this game. In the questions that follow, we imagine that a successful attack on site i will cost the defender C. 5) What is the expected or average cost of an attack, given strategies {q}, {p.}? 6) If you knew {q1,....qN} in advance, how should you choose {p.} to minimize the expected cost of an attack? 7) If you were the attacker, and knew that your opponent was trying to minimize the expected cost of your attack, how should you choose {q.} to maximize the expected cost of an attack? (Assume that your strategy is going to leak to your opponent.) 8) Questions 2.5, 2.6, 2.7 address the problem of the expected cost of an attack from the perspective of the attacker thinking about the best possible defender. Consider as well the the perspective of the defender thinking about the best possible attacker. Re-do 2.5, 2.6, 2.7 from this perspective, then argue what the 'final' strategies for each player will be in this game. Restricting ourselves to two sites, site A and site B, suppose that a successful attack on site i gives a reuward of R, to the attacker, at cost C, to the defender. if the attacker wants to marimize their erpected Bonus reward, and the defender wants to minimize their erpected cost, what strategies should they follow, and why? What if they had the opportunity to negotiate beforehand, how would that change things? Note, this will depend heavily on how {RA, Rp}, {CA,CB} relate to each other.
MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
Related questions
Question
please send handwritten solution for Q 3
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman