for Analy zing Terrorism

Similar documents
Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Chapter 30: Game Theory

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

ESSENTIALS OF GAME THEORY

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

Math 464: Linear Optimization and Game

Arpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore

Dominance and Best Response. player 2

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan

Lecture 6: Basics of Game Theory

Microeconomics of Banking: Lecture 4

DECISION MAKING GAME THEORY

LECTURE 26: GAME THEORY 1

Prisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)

INTRODUCTION TO GAME THEORY

Introduction to Game Theory

Games. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Advanced Microeconomics: Game Theory

Mixed Strategies; Maxmin

Lecture #3: Networks. Kyumars Sheykh Esmaili

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

THEORY: NASH EQUILIBRIUM

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

CHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:

A short introduction to Security Games

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

Game theory. Logic and Decision Making Unit 2

What is... Game Theory? By Megan Fava

Introduction to Game Theory I

Game Theory and Randomized Algorithms

Part 2. Cooperative Game Theory

Finite games: finite number of players, finite number of possible actions, finite number of moves. Canusegametreetodepicttheextensiveform.

Dominant Strategies (From Last Time)

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan

Topics in Applied Mathematics

Dominant and Dominated Strategies

[ Game Theory ] A short primer

An Application of Game Theory to Electronic Communications Markets *

First Prev Next Last Go Back Full Screen Close Quit. Game Theory. Giorgio Fagiolo

CPS 570: Artificial Intelligence Game Theory

2. The Extensive Form of a Game

Lecture Notes on Game Theory (QTM)

ECO 463. SimultaneousGames

Analyzing Games: Mixed Strategies

CMU-Q Lecture 20:

CS510 \ Lecture Ariel Stolerman

Introduction to Auction Theory: Or How it Sometimes

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

Weeks 3-4: Intro to Game Theory

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

A Survey on Supermodular Games

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan

Dominant and Dominated Strategies

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas

Cooperative versus Noncooperative Game Theory

Simultaneous-Move Games: Mixed Strategies. Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley

(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1

DEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University

Optimization of infrastructure sharing in telecommunications networks

ECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

SF2972 GAME THEORY Normal-form analysis II

Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1

Problem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1

Computing Nash Equilibrium; Maxmin

Introduction. Begin with basic ingredients of a game. optimisation equilibrium. Frank Cowell: Game Theory Basics. July

Game Theory: Basics MICROECONOMICS. Principles and Analysis Frank Cowell

Multi-player, non-zero-sum games

Game Theory. Wolfgang Frimmel. Dominance

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue

Nash Equilibrium. An obvious way to play? Player 1. Player 2. Player 2

Multi-Agent Bilateral Bargaining and the Nash Bargaining Solution

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

October 14, :17 WSPC/INSTRUCTION FILE Goranko-Turrini Final Version-VG TWO-PLAYER PREPLAY NEGOTIATION GAMES WITH CONDITIONAL OFFERS

Modeling Security Decisions as Games

Game Theory: Normal Form Games

Rationality and Common Knowledge

Appendix A A Primer in Game Theory

EconS Game Theory - Part 1

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

Computational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples

Chapter 2 Basics of Game Theory

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Distributed Optimization and Games

Minmax and Dominance

Theory of Moves Learners: Towards Non-Myopic Equilibria

Self-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1

Lect 15:Game Theory: the math of competition

ECO 5341 Strategic Behavior Lecture Notes 3

Cognitive Radios Games: Overview and Perspectives

Transcription:

Game Th e or y as a To ol for Analy zing Terrorism Vito FRAGNELLI Università del Piemonte Orientale Dipartimento di Scienze e Tecnologie Avanzate Via V.Bellini 25/G 15100 Alessandria, Italy vito.frag n e l l i@mfn. un ipmn.it Abstract Terrorist attacks may have a deep impact on our society; for this reason it is necessary that all the disciplines give their contribution for limiting its negative effects. In this note we want to show that Game Theory may be helpful for studying some aspects of terrorism. 1 Introduction Terrorism represents a relevant challenge for our society as it can modify the behavior of large part of the population and may also attract the attention of policy-makers and move large monetary amounts, with consequences on the economic activities of a nation. Usually, the scenario involves two main actors, the government on one side and the terrorist organizations on the other one. As it is pointed out in [3] studies of terrorism risk resemble risk analyses of complex engineering systems but unlike natural disasters, it features human intelligence, and unlike industrial disasters it features human intent. This leads to the possibility of modeling and analyzing the situation with the instruments of Game Theory, a discipline that studies, with methods classical for mathematics, the human behavior in those situations in which the final outcome depends on the actions taken by various decision-makers involved in it. We can remark that several game theorists tackled the topic of terrorism in last recent years. Fragnelli, V. (2006). In Tactical Decision Making and Situational Awareness for Defence Against Terrorism (pp. 4-1 4-8). Meeting Proceedings RTO-MP-SCI-174, Paper 4. Neuilly-sur-Seine, France: RTO. Available from: http://www.rto.nato.int/abstracts.asp. RTO-MP-SCI-174 4-1

In the following section we introduce some basic elements of Game Theory and in the third section we present in a very informal way three examples of game theoretical approaches to situations related to terrorism. 2 Preliminaries on Game Theory We start this section recalling the main ingredients of a game, i.e. of an interactive situation: the players, i.e. the agents, or more precisely, the decision-makers of the situation; the set strategies of each player, i.e. the possible alternatives among which each agent may choice; the utility function of each player, i.e. the gain or the loss (in a very wide sense) that each agent gets as consequence of each possible outcome. A player is supposed to be rational, in the sense that his choice is driven by the possibility of reaching a final situation from which he obtain a higher utility and is supposed to be intelligent, in the sense that he knows all the possible outcomes of the situation and which subset of outcomes can be obtained after his strategic choice. Of course the outcome can be determined only after the choices of all the agents; the resulting set of strategies, one for each player, is called a strategy profile. In the simplest interactive situation each agent makes his selection in his strategy set independently from the others; the different choices produce a final situation that is evaluated by each agent according to his utility function. These situations are denoted as non cooperative games. In general the players may improve their utilities if they may coordinate their choices; more precisely we said that binding agreements are allowed. Of course this new scenario requires the possibility of discussions among the players for negotiating a satisfactory strategy profile and the existence of a superpartes authority that may impose the respect of the agreement to the agents. These situations are denoted as cooperative games. The agents, maybe all, that subscribe the agreement form a coalition. Cooperative games are usually divided into two groups, the non transferable utility games (NTU-games) or games without side payments and the 4-2 RTO-MP-SCI-174

transferable utility games (TU-games) or games with side payments. The main difference between these two groups refers to the possibility for the players of a coalition to redistribute among them the total utility they get at the end of the game or not; so, in a NTU-game the players of a coalition get the payoff that the rules of the game assign to them according to the strategy profile, while in a TU-game the players collect their utilities an assign to each player a quota according to the agreement they reached. Of course it is necessary that the utilities of the players of a coalition may be added. In a non cooperative game and in a NTU-game the solution is a strategy profile that takes into account the needs of all the players; in TU-game the solution is a division rule for deciding which quota of the total utility is assigned to each player. Now we present a very simple example, known in literature as prisoner s dilemma, in order to make clearer the previous concepts. Example 1 We consider two players, I and II, each of them has two strategies; the strategies of player I are denoted as T and B, and the strategies of player II are denoted as L and R. We represent the game using a table with two rows and two columns in which each row is associated with a strategy of player I and each column is associated with a strategy of player II. In each cell of the table we write two numbers that represent the monetary utilities obtained from player I and player II, respectively, when the two players choose the strategies associated to the row and the column the cell belongs to. The situation we have in mind is represented by the following table: II L R I T 2 9 2 1 B 1 4 9 4 First, let us suppose that the players do not (or cannot) cooperate; player I realizes that the strategy T is preferable, because his payoff is anyhow larger (2 > 1 and 9 > 4) and in a similar way player II prefers strategy L; so, the resulting strategy profile is {T,L} and the utility is 2 for each of the two players. Now, let us suppose that the two players may subscribe a binding agreement, RTO-MP-SCI-174 4-3

it is straightforward that the two players select the strategy profile {B,R} getting the utility 4 for each of them; finally, if they may also exchange their total utility they may agree on one of the two strategy profiles {T,R} or {B,L} that give them a global utility of 10 instead of 8, that they may share in several ways, for example 5 each. It is worthwhile to note that all the four strategy profiles can be chosen if we consider that the players may cooperate or not and may transfer the utility or not. Game theory literature contains several solutions concepts for all the three classes of games; here we just mention the Nash Equilibrium for non cooperative games, the Nash cooperative solutions for the NTU-games and the core and the Shapley value for the TU-games. We refer to [6] and [4] for further details on game theory. 3 Three Examples In this section we present three examples, one for each class of games, taken from the existing literature, in order to show how game theoretic tools may be used for studying terrorist situation. 3.1 Non Cooperative Example The first example is a simplified version taken from [8]. Consider a terrorist organization located in a home base and a bank as potential target; suppose that the terrorist uses a car for reaching the bank and must get through a checkpoint to carry out the bombing operation; the possible outcomes are that the terrorist reaches the bank succeeding and escaping to return home, or getting caught at the checkpoint or bank, leading to being placed in custody or getting killed in a shootout. The situation may be represented by the following graph: 4-4 RTO-MP-SCI-174

Shooting Escape or abort Checkpoint Get caught Home 2 Drive Drive Die Dead Custody Die Escape Bank Get caught Carbomb The authors examine the checkpoint situation with the instruments of game theory. Drive Shoot Shoot Get Terrorist through guard guard caught unnoticed and escape and die unnoticed Guard Unready 1 2 2 2 4 3 1 1 Ready 2 3 0 3 3 1 1 2 The previous table shows that at the checkpoint, the terrorist could find the guard welltrained and in ready mode or in an untrained, easily surprised mode. In the latter case, the terrorist might feel there is some degree of positive utility in driving through unnoticed, shooting the guard and continuing (or dying). The only embarrassing outcome would be to get caught by an unready guard. In the second row, the terrorist has less utility for engaging in a shootout with a trained guard, as getting caught can lead to eventual release. The utilities of the guard in each row may be similarly interpreted. The authors remark that this example is illustrative, and no real utility values have been specified. It will be a step of the research to conduct the datamining and to interact with experts to elicit the proper structure of the graph and the table elements and utilities. 3.2 NTU-Game Example A special NTU-Game situation is the so-called Two-Person Bargaining Problem, introduced by Nash in 1950 (see [5]). In [7] Owen generalizes this prob- RTO-MP-SCI-174 4-5

lem to the case in which the two players act as representatives; in particular they represent a state and a terrorist organization. The main difference is that in each organization there are persons that accept only strong conditions for the counterpart, the so-called hawks, and persons that are available also for weak conditions, the so-called doves. The author modifies the classical model, introducing a n-person situation in which for each organization several members have similar but not coincident interests, i.e. the organization are heterogeneous. The members of each organization have similar utilities for the agreements reached, but different utilities for conflict. The hawks of a party may take actions in order that the counterparty rethinks the value of the agreement; consequently the number of members of the counterparty favorable to the agreement decreases; if also these last members act against the agreement it is possible that the it falls. In a sense the hawkish members seem more in cooperation (against the agreement) than opponents. An interesting remark is about the role of a third party that may subsidize the agreement... by making some sort of side payment to the members of the organization. 3.3 TU-Game Example In this case we refer to a situation taken from [9]; this example shows that making common the information of each player may improve the global utility of all the players, where we may think to the possibility of sharing information against terrorism even if not all the agents have the same target. The authors consider a small hotel with 8 rooms, 4 on the bottom floor and 4 on the top floor. On each floor, two rooms are on the north side and two rooms on the south side; on the other hand, on each floor two rooms are on the east side and two rooms on the west side. So, using the floor and the directions north-south and east-west each room may be uniquely described. In one of the rooms of the hotel there is a monster; three persons that sleep in the hotel have partial information about the hiding place of the monster and different preferences. Player 1 knows whether the monster is on the north or south side, player 2 whether it is on the west or east side and player 3 whether it is on the bottom or top floor. Player 1 wants to be as far away from the monster as possible. Player 2 is interested only in being on a different floor than the monster, while player 3 would like to catch the monster and, hence, wants to be in the same room as the monster. It seems 4-6 RTO-MP-SCI-174

obvious that all players profit from sharing information. In this case the result of cooperation is that the players in a coalition share their own information. Clearly player 3 needs the cooperation of all the players in order to know the room of the monster; on the other hand if player 2 forms a coalition with player 3 gets all the information required, but has no incentive to cooperate with player 1; finally, the situation of player 1 is a little bit different. In order to maximize his distance from the monster he needs the full information, i.e. he has to form a coalition with all the players, but also using his sole information he can avoid the room of the monster and a coalition with one of the other two players may give him an intermediate result. Note that in the last two cases, using a random choice, player 1 may get the maximal utility (if he is lucky). The paper by Slikker et al. proposes also possible rewards for the players when they share their information, depending on their different interest in cooperation. 4 Concluding Remarks In this note we presented some simple game theoretic models that can be useful to define strategies against terrorism. The list of authors that used game theory for studying particular aspects of terrorist situations is very long; among them there are Bueno de Mesquita, who in [1] analyzes how decisions of one of the two sides influence the behavior of the other one, taking into account also government investment in counter-terror, negotiated settlements, duration of terrorist conflicts, incentives for moderate terrorists to radicalize their followers, and incentives for governments to encourage extremist challenges to moderate terrorist leaders; Keet in [2] investigates theories of terrorism and its changes over time and applications of game theory, in particular mutations of the prisoner s dilemma, extensive form games for disclosing interactions between actors in a structured format and cooperative games for studying coalition-formation process and strengths and weaknesses in negotiation processes. The aforementioned models were applied to various situations: Israel, Iraq and Peru. We conclude just mentioning other authors as McCormick who cooperates from long time with Owen, Dietrich who gives a general model for prevention, Woo that analyses the insurance side of the problem, Arce and Sandler that suggest the prevalence of deterrence over preemption. RTO-MP-SCI-174 4-7

References [1] E. Bueno de Mesquita (2003) An Adverse Selection Model of Terrorism, Proceedings of the Annual Meetings of the International Studies Association [2] C.M. Keet (2003) Terrorism and Game Theory - Coalitions, Negotiations and Audience Costs, MA dissertation [3] J.A. Major (2002) Advanced Techniques for Modeling Terrorism Risk, Carpenter Report [4] R.B. Myerson (1991) Game Theory: Analysis of Conflict, HarvardUniversity Press [5] J.F. Nash (1950) The Bargaining Problem, Econometrica 18 : 155-162 [6] G. Owen (1994) Game Theory, 3rd edition, AcademicPress [7] G. Owen (2000) Organizational Bargaining, Hamburg Institute of International Economics Discussion Paper n.142 [8] R. Weaver, B.G. Silverman, H. Shin, R. Dubois (2001) Modeling and Simulating Terrorist Decision-making: A Performance Moderator Function Approach to Generating Virtual Opponents, WorkingPaper [9] M. Slikker, H. Norde, S. Tijs (2003) Information Sharing Games, International Game Theory Review 5 : 1-12 4-8 RTO-MP-SCI-174