Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/9/13 Modeling secrecy and deception in a multiple- period attacker–defender signaling game 1.

Slides:



Advertisements
Similar presentations
The Basics of Game Theory
Advertisements

Introduction to Game Theory
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Non myopic strategy Truth or Lie?. Scoring Rules One important feature of market scoring rules is that they are myopic strategy proof. That means that.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
VARIATIONS ON SIMPLE PAYOFF MATRICES Topic #6. The Payoff Matrix Given any payoff matrix, the standard assumption is – that the players choose their strategies.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
Part 3: The Minimax Theorem
Extensive Games with Imperfect Information
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/3/07 Defending simple series and parallel systems with imperfect false targets R. Peng, G. Levitin,
Using Game Theoretic Approach to Analyze Security Issues In Ad Hoc Networks Term Presentation Name: Li Xiaoqi, Gigi Supervisor: Michael R. Lyu Department:
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/10/25 1 Research Direction Introduction.
Adverse Selection Asymmetric information is feature of many markets
Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi-Cin Lin Advisor:
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Small business banking and financing: a global perspective, Cagliari The impact of an IFRS-adoption on relationship lending for German SMEs – An economic.
An Introduction to Game Theory Part IV: Games with Imperfect Information Bernhard Nebel.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
1 Introduction APEC 8205: Applied Game Theory. 2 Objectives Distinguishing Characteristics of a Game Common Elements of a Game Distinction Between Cooperative.
Job Market Signaling (Spence model)
QR 38 Signaling I, 4/17/07 I. Signaling and screening II. Pooling and separating equilibria III. Semi-separating equilibria.
APEC 8205: Applied Game Theory Fall 2007
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Games People Play. 6. Uncertainty and Information Many strategic situations involve the players having different information. In this section we shall.
MAKING COMPLEX DEClSlONS
Chapter 9 Games with Imperfect Information Bayesian Games.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Classifying Attributes with Game- theoretic Rough Sets Nouman Azam and JingTao Yao Department of Computer Science University of Regina CANADA S4S 0A2
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
Dynamic Games & The Extensive Form
Extensive Games with Imperfect Information
Topic 3 Games in Extensive Form 1. A. Perfect Information Games in Extensive Form. 1 RaiseFold Raise (0,0) (-1,1) Raise (1,-1) (-1,1)(2,-2) 2.
REDUNDANCY VS. PROTECTION VS. FALSE TARGETS FOR SYSTEMS UNDER ATTACK Gregory Levitin, Senior Member, IEEE, and Kjell Hausken IEEE Transactions on Reliability.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Defender Message Strategies to Maximize Network Survivability for Multi-Stage Defense Resource.
Incomplete information: Perfect Bayesian equilibrium
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih Defending against multiple different attackers Kjell Hausken, Vicki M. Bier 2011/3/14 1.
5.1.Static Games of Incomplete Information
Lec 23 Chapter 28 Game Theory.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Research Direction Introduction.
Game Theory Georg Groh, WS 08/09 Verteiltes Problemlösen.
How to think about strategic games
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Adviser: Frank,Yeong-Sung Lin Present by 瀅如
Games with Imperfect Information Bayesian Games
EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Optimal defence of single object with imperfect false targets
Presentation transcript:

Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/9/13 Modeling secrecy and deception in a multiple- period attacker–defender signaling game 1

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 2

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 3

Introduction 2011/9/13 Most applications of game theory to homeland-security resource allocation so far have involved only one-period games. Dresher (1961) was among the first researchers to apply game theory to military strategic interactions. However, he did not explicitly model deception and secrecy. Recent game-theoretic research has also indicated that publicizing defensive information instead of keeping it secret may help to deter attacks. 4

Introduction 2011/9/13 In practice, however, security-related information such as defensive resource allocations is often kept secret. There is a long tradition of deception in the military arena, as well as in business and capital ventures. Few of these studies have focused specifically on disclosure of resource allocations. Defenders might also have incentives to deceive by either overstating or understating their defenses, to deter or disinterest potential attackers, respectively. 5

Introduction 2011/9/13 Zhuang and Bier (2007) indicate that truthful disclosure should always be preferred to secrecy, which is not surprising, since their model is a game of complete information. Attacker uncertainty about defender private information can create opportunities for either defender secrecy or deception. Zhuang and Bier (2011) found that defender secrecy and/or deception could be strictly preferred in a one-period game in which the defender has private information (i.e., the attacker is uncertain about the defender type). 6

Introduction 2011/9/13 Secrecy has been sometimes modeled as simultaneous play in game theory, since in a simultaneous game, each player moves without knowing the moves chosen by the other players. Some researchers have modeled deception as sending noisy or imperfect signals to mislead one’s opponents. Hespanha et al. (2000) and Brown et al. (2005) defined deception in a zero-sum attacker-defender game as occurring when the defender discloses only a subset of the defenses, in an attempt to route attacks to heavily-defended locations. 7

Introduction 2011/9/13 By contrast, this paper defines deception as disclosing a signal (in the domain of the action space) that differs from the chosen (hidden) action. This paper applies game theory to model strategies of secrecy and deception in a multiple-period attacker-defender resource-allocation and signaling game with incomplete information. 8

Introduction 2011/9/13 Games are classified into two major classes: cooperative games and non-cooperative games. In traditional non-cooperative games it is assumed that 1. The players are rational. 2. There are no enforceable agreements between players. 3. The players know all the data of the game. However, real-game situations may involve other types of uncertainty. 9

Introduction 2011/9/13 In this paper they focus on the case where the defender does have private information, while the attacker does not. In this case, they allow two types of updates about the defender type – the attacker updates his knowledge about the defender type after observing the defender’s signals, and also after observing the result of a contest (if one occurs in any given time period). 10

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 11

Signaling game 2011/9/13 12 Games are classified into four major classes.

Signaling game 2011/9/13 13 A signaling game is a dynamic game of incomplete information involving two players, a Sender and a Receiver. It involves two players – one with private information, the other without – and two moves: first the informed player (Sender, she) makes a decision, she "sends a signal". then the uninformed player (Receiver, he) – having observed the informed player’s decision but not her private information – makes a decision, he "reacts to the signal".

Signaling game 2011/9/13 14 The timing of the game is as follows:  Nature selects a type t i for Sender from a set of feasible types T = {t 1,..., t I } according to a commonly-known probability distribution p(.), where p(t i ) > 0 (prior belief) for every i ∈ {1,...,I} and Σ p(t i ) = 1.  Sender observes t i and, on the basis of t i, chooses a message m j from a set of feasible messages M = {m 1,...,m J }.  Receiver observes m j and, on the basis of m j, selects an action a k from a set of feasible actions A ={a 1,...,a K }.  Payoffs are realised: if nature has drawn type t i, S has chosen message m j and R has selected action a k, then payoffs for S and R are u S (t i, m j, a k ) and u R (t i, m j, a k ).

Signaling game 2011/9/13 15

Signaling game 2011/9/13 16 Spence’s (1973) job market signalling model: Sender: a worker in search for a job. Receiver: a (potential) employer (or the market of prospective employers). Type: the worker’s productivity. Message: the worker’s education choice. Action: the wage paid to the worker.

Signaling game 2011/9/13 17 In a signaling game, there can be any or all of the following Perfect Bayesian Equilibrium (PBE): Pooling equilibrium: In a pooling PBE, both types of Sender choose the same message, so that they cannot be distinguished on the basis of their behavior. (pure strategy) Separating equilibrium: In a separating PBE, each Sender type chooses a different message, so that the message perfectly identifies the player type. (pure strategy) Semi-separating equilibrium: In a semi-separating PBE, one type of Sender plays a pure strategy while the other plays a mixed strategy. As a result, Receiver is able to imperfectly update his prior beliefs about Sender’s type. (mixed strategy)

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 18

Model formulation for repeated game 2011/9/13 19 This paper’s game has two players: an attacker (he, signal receiver, A); and a defender (she, signal sender, D). This paper’s model involves a N-period game with private defender information.

Model formulation for repeated game 2011/9/13 20 For simplicity, this paper considers only a two-type model; i.e., the defender type θ equals θ 1 with probability p 1 and θ 2 with probability 1-p 1. This paper assumes that p 1, the attacker’s prior probability at the beginning of the period 1, is common knowledge to both the attacker and the defender.

Model formulation for repeated game 2011/9/13 21 First, a defender of type θ chooses a strategy d t (θ) and a signal s t (θ) for θ = θ 1, θ 2. d t (θ) = 0 : The defender invests in short term expenses (such as police patrol) in period t. d t (θ) = 1 : The defender invests in capital defenses in period t. s t (θ) {0, 1, S} be the signal sent by a defender of type θ about its defensive choice.

Model formulation for repeated game 2011/9/13 22 The attacker observes the signal s t (θ), updates his belief from the prior p t to the posterior p' t, and chooses an attacker response a t (s t ). a t (s t ) = 0 is the decision to do nothing during period t. a t (s t ) = 1 represents the decision to launch an attack.

Model formulation for repeated game 2011/9/13 23 If both defender types send the same signal at equilibrium, s t (θ 1 ) = s t (θ 2 ), then p' t (posterior belief) = p t (prior belief). (Pooling equilibrium) If different defender types send different signals at equilibrium, s t (θ 1 ) ≠ s t (θ 2 ), then the attacker is able to recognize the defender type with certainty, in which case p' t = 1 with probability p t, and 0 with probability 1-p t. (Separating equilibrium)

Model formulation for repeated game 2011/9/13 24

Model formulation for repeated game 2011/9/13 25 This paper assumes for simplicity that the actual level of damage to the target is either 100% or zero. attacker defender Conditional probability that an attack would succeedattacker’s target valuations attack cost defender’s target valuationsConditional probability that an attack would succeed Defense cost

Model formulation for repeated game 2011/9/13 26 This contest success function is assumed to be of the form. where α > 1 is the effectiveness of defender short-term expenses relative to defender capital investment in security; ρ t-k is the fraction of defensive capital from period k that is still effective in period t. the effective defense short-term capital investment

Model formulation for repeated game 2011/9/13 27

Model formulation for repeated game 2011/9/13 28 Let β A and β D be the attacker and defender discount factors, respectively. (the current payoff, plus the discounted expected future equilibrium payoff) attacker defender

Model formulation for repeated game 2011/9/13 29 Definition 1. We call the collection {a*(s), d*(θ), s*(θ), p*, p'*} an equilibrium if the following four conditions are satisfied:

Model formulation for repeated game 2011/9/13 30 Definition 1. We call the collection {a*(s), d*(θ), s*(θ), p*, p'*} an equilibrium if the following four conditions are satisfied:

Model formulation for repeated game 2011/9/13 31 Definition 1. We call the collection {a*(s), d*(θ), s*(θ), p*, p'*} an equilibrium if the following four conditions are satisfied:

Model formulation for repeated game 2011/9/13 32 Definition 2. In an equilibrium {a*(s), d*(θ), s*(θ), p*, p‘*}, we say that in period t, a defender of type θ chooses: The cost of implementing truthful disclosure is lower than the costs of implementing secrecy and deception, respectively.

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 33

Attacker observes defensive investment from the previous period 2011/9/13 34 The model is under the assumption that the attacker can observe the previous period’s defensive choice, d t-1, at the beginning of period t. They still allow the defender’s private information to remain secret throughout the entire game, if not revealed by the defender’s choices. However, with this assumption, the defender cannot choose deception or secrecy at optimality for more than one time period.

Attacker observes defensive investment from the previous period 2011/9/13 35 For computational convenience, they assume that capital can be carried over only to the immediate next period. (ρ k = 0 for k ≥ 2, and ρ 1 = ρ)

Attacker observes defensive investment from the previous period 2011/9/13 36

Attacker observes defensive investment from the previous period 2011/9/13 37 Case A (p t = 0 or p t =1): In this case, at the beginning of period t, the attacker already knows whether the defender is of type θ = θ 2 or θ = θ 1.

Attacker observes defensive investment from the previous period 2011/9/13 38 For all 48 cases, we calculate e t using Eq. (11), and let p' t (posterior belief) = p t+1 (prior belief) = p t (prior belief). The attacker and defender total expected payoffs are calculated as the sum of the current payoff plus the discounted future equilibrium payoff:

Attacker observes defensive investment from the previous period 2011/9/13 39 Case B (0 < p t < 1): In this case, at the beginning of period t, the attacker is uncertain about the defender type, and we have a three player, 8*6*6 game. For all 288 cases, we calculate e t (θ) using Eq. (11), and then determine p' t stochastically as a function of s t (θ), s t (θ 2 ), and p t, using condition 3 of Definition 1.

Attacker observes defensive investment from the previous period 2011/9/13 40 the attacker payoff is given by: the payoff to a defender of type h is given by:

Attacker observes defensive investment from the previous period 2011/9/13 41 In the examples in the following sections, we use the following baseline parameter values: N = 2; p 1 = 0.9; β A = 0.9; β D (θ 1 ) = β D (θ 2 ) = 0.9; ρ(θ 1 ) = ρ(θ 2 ) = 0.5; α(θ 1 ) = α(θ 2 ) = 2; v A (θ 1 ) = v A (θ 2 ) = 20; v D (θ 1 ) = v D (θ 2 ) = 20. Moreover, we use the following baseline costs:

Attacker observes defensive investment from the previous period 2011/9/ Effectiveness of expenses as defender private information Here, we let α(θ 1 ) = 2 and α(θ 2 ) = 4 be the defender private information. Defender’s strategyDefender’s signal

Attacker observes defensive investment from the previous period 2011/9/ Effectiveness of expenses as defender private information Here, we let α(θ 1 ) = 2 and α(θ 2 ) = 4 be the defender private information. Defender’s strategyDefender’s signal θ1θ1 θ2θ2

Attacker observes defensive investment from the previous period 2011/9/ Effectiveness of expenses as defender private information Here, we let α(θ 1 ) = 2 and α(θ 2 ) = 4 be the defender private information. Defender’s strategyDefender’s signal

Attacker observes defensive investment from the previous period 2011/9/ Effectiveness of expenses as defender private information Here, we let α(θ 1 ) = 2 and α(θ 2 ) = 4 be the defender private information. Defender’s strategyDefender’s signal

Attacker observes defensive investment from the previous period 2011/9/ Target valuation as private information We consider α(θ 1 ) = α(θ 2 ) = 1.5; v A (θ 1 ) = v D (θ 1 ) = 10 and v A (θ 1 ) = v D (θ 2 ) = 20. Defender’s strategyDefender’s signal θ1θ1 θ2θ2

Attacker observes defensive investment from the previous period 2011/9/ Defender costs as private information We consider α(θ 1 ) = α(θ 2 ) = 2 and the defender of type θ 2 has higher costs for all signals than the defender of type θ 1 when the defenses are given by d = 0.

Attacker observes defensive investment from the previous period 2011/9/ Defender costs as private information We consider α(θ 1 ) = α(θ 2 ) = 2 and the defender of type θ 2 has higher costs for all signals than the defender of type θ 1 when the defenses are given by d = 0. Defender’s strategyDefender’s signal

Attacker observes defensive investment from the previous period 2011/9/ Other parameters as defender private information In cases where the defender’s private information is associated only with future payoffs (such as the carry-over coefficients ρ k and the discount rate β D ), they have not found deception or secrecy in their numerical model, despite an extensive computer search.

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 50

Attacker does not observe defensive investment 2011/9/13 51 For simplicity, this paper also assumes that the attacker does not observe the result of the contest from the previous period. Therefore, we need to solve a three-player 8 N *6 N *6 N game, where N is the number of periods. We let the cost be the defender’s private information.

Attacker does not observe defensive investment 2011/9/13 52

Agenda 2011/9/13 Introduction Signaling game Model formulation for repeated game Attacker observes defensive investment from the previous period Attacker does not observe defensive investment Conclusions and future research 53

Conclusions and future research 2011/9/13 54 This work uses game theory and dynamic programming to model a multiple-period, attacker– defender, resource-allocation and signaling game with incomplete information. This paper’s numerical examples show that defenders can sometimes achieve more cost-effective security through secrecy and deception in a multiple-period game. One limitation to this paper is that their algorithm does not automatically identify mixed strategies.

Conclusions and future research 2011/9/13 55 Although they found secrecy and deception as equilibrium strategies, which is somewhat unusual in the literature, such equilibria were relatively rare and difficult to obtain in our model, compared to the frequency with which secrecy and deception are observed in practice. They suspect that this may be at least in part because of some of the more unrealistic assumptions of game theory (e.g., common knowledge, full rationality).

Thanks for your listening. 2011/9/13 56