12.3 Armed Conflict: Consider the following strategic situation: Two rival armies plan to seize a disputed territory. Each army's general can choose either to attack (A) or to not attack (N). In addition, each army is either strong (S) or weak (W) with equal probability, and the realizations for each army are independent. Furthermore the type of each army is known only to that army's general. An army can capture the territory if either (i) it attacks and its rival does not or (ii) it and its rival attack, but it is strong and the rival is weak. If both attack and are of equal strength then neither captures the territory. As for payoffs, the territory is worth m if captured and each army has a cost of fighting equal to s if it is strong and w if it is weak, where s

12.3 Armed Conflict: Consider the following strategic situation: Two rival armies plan to seize a disputed territory. Each army's general can choose either to attack (A) or to not attack (N). In addition, each army is either strong (S) or weak (W) with equal probability, and the realizations for each army are independent. Furthermore the type of each army is known only to that army's general. An army can capture the territory if either (i) it attacks and its rival does not or (ii) it and its rival attack, but it is strong and the rival is weak. If both attack and are of equal strength then neither captures the territory. As for payoffs, the territory is worth m if captured and each army has a cost of fighting equal to s if it is strong and w if it is weak, where s

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

2. Consider two players playing a simultaneous moves game. These players can be one of the two states of the world, state 1 or state 2, while playing the game. The payoffs-matrix for the two state games are as follows: State 1 P1 U D P2 L R 1,4 1,0 1,6 2,16 0,0 0,24 M State 2 P1 U D P2 L M R 1,0 1,4 1,6 2,16 0,24 0,0 Each players believes that the two states are equally likely, Derive the BNE of the game.
2. Consider the following Bayesian game with two players. Both players move simultaneously and player 1 can choose either H or L, while player 2's options are G, M, and D. With probability 1/2 the payoffs are given by "Game 1" : GMD H 1,2 1,0 1,3 L 2,4 0,0 0,5 and with probability 1/2 the payoffs are according to "Game 2" : G |M|D H 1,2 1,3 1,0 L 2,4 0,5 0,0 (a) Find the Nash Equilibria when neither player knows which game is actually played. (b) Assume now that player 2 knows which one among the two games is actually being played. Check that the game has a unique Bayesian Nash Equilibrium.
Let there be two players in a game, Player 1 and Player 2. Consider a jar containing 5 snakes. 3 of the snakes in the Kjar are venomous, while the remaining 2 are non-venomous. In the game, both the players have to put their hand in the jar one after the other and pick a snake out. Each snake, if picked out of the jar, will bite the player's hand. The event of picking a venomous snake, or equivalently, a venomous snake's bite will earn the player zero points. On the other hand, the event of picking a non-venomous snake, or equivalently, a non-venomous snake's bite will earn the player one point. Let X denote Player 1's pick and let Y denote Player 2's pick. Suppose Player 1 is the first to pick out a snake. The expected value of Player 1's pick is: E(X)= (Express your answer as a fraction or round your answer to two decimal places)
Table 9-03. Suppose you are a general in the army. Your country is at war. You are trying to invade the enemy. You can attack on the enemys east coast or the west coast. The enemy has only enough troops to defend one coast. The payoff matrix below represents whether you or the enemy wins (represented by 1) or loses (represented by 0). Enemy Defend east coast Defend west coast Enemy: 1 Enemy: 0 Attack east coast You: 0 You: 1 You Enemy: 0 Enemy: 1 Attack west coast You: 1 You: 0 Refer to Table 9-03. To win the war, O a. you must attack the west coast, only if you have credible information that the enemy is defending the east coast. O b. you must attack the west coast, and information about whether the enemy is defending the east or the west coast is irrelevant to you. c. you must attack the west coast, only if you have credible information that the enemy is defending the west coast. d. you must never attack the west coast, and information about whether the enemy is defending the east or…
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…
GAME UUU B1 Player B B2 A1 7,13 5, 10 A2 3,8 9,16 Player A A3 5,8 4,7 In Game UUU (see table above), assuming players move simultaneously, Player A choosing A1 and Player B choosing B3 is a Nash equilibrium. Player A choosing A3 and Player B choosing B2 is a Nash equilibrium. Both Player A choosing A1 and Player B choosing B1 and Player A choosing A2 and player B choosing B2 are Nash equilibria in pure strategies Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.
i. ii. QUESTION ONE A. A Nash equilibrium is a strategy profile such that every player's strategy is the best response to all the other players. It requires that each player makes a best response and that expectations regarding the play of other players are correct. Below is the table showing strategies and payoff for Player 1 and Player 2. PLAYER 1 R1 R2 R3 R4 C1 0,7 5,2 7,0 6,6 C2 2,5 3,3 2,5 2,2 PLAYER 2 C3 7,0 5,2 0,7 4,4 CA 6,6 2,2 4,4 10,4 REQUIRED; Transform the normal form game above into an imperfect extensive game form Find the Nash equilibrium for the game above using iterative deletion of strictly dominated strategies. Find the Nash equilibrium using brute force or cell by cell inspection.
please discuss the separation eqilibrium in details 1. Assume that two players play the Tinder game. There are two types of potential boyfriends: the gentleman (25% of the population) and the douchebag (75% of the population), and they can decide on the different level of effort: low, medium, and high. For the first type, the respective costs are 30, 50, and 80. For the second type, the respective costs are 50, 75, and 120. For the potential boyfriend, the payoff from being in relationship is 130, and the payoff associated with being dumped is 70. The girl can get 60 if she stays single, 100 if she is in relationship with the gentleman, and 25 if she dates the douchebag (credits to Owen Sims) a) Present the game in the extensive form b) Calculate the expected pay-off for the girl. Should she date at all? c) Discuss whether the game has a separating equilibrium
Question > Consider the following matrix game where Player 1 moves first then Player 2 observes player 1's move and responds. Draw the game tree for the sequential move game and then determine all the Nash equilibria. Player 1 Strategy A Strategy B Strategy C Strategy D -3, -2 10, 12 9, 20 Player 2 Please show each step on how to get the answer. Thank you! Strategy E 13,7 17, 17 12, 21 Strategy F 20,8 22, 16 19, 19
H2. One day, Sam and Ryan play odds/evens to see who gets the last doughnut. On command, they each extend one or two fingers. If the sum is odd Sam wins the doughnut, if the sum is even Ryan wins the doughnut. Suppose the payoff from winning the doughnut is 1 and the payoff from losing is 0. a) Illustrate this interaction as a game in matrix form. b) Suppose that Sam thinks that Ryan will play one finger for sure? What will Sam play? Does Sam have reason to think that Ryan will play one finger for sure? c) Do either of them have a strictly dominated strategy? d) Find the pure strategy Nash equilibria of the game, if any. e) Suppose that Sam thinks that Ryan will play one finger or two fingers with even odds. Will Ryan play one finger for sure, play two fingers for sure or play each strategy with even odds? Does Sam have good reason to believe that Ryan will play one finger or two fingers with even odds?
6. Two players each pick a positive integer between 1 and 100. If the numbers are identical, noone wins. If the numbers differ by 1, the one with the lower number pays 1 to the opponent. If the difference is at least 2, the one with the higher number pays 2 to the opponent. What is the NE? Hint: Draw a sketch of the game matrix (while you can't consider all 100 strategies, at least consider the lowest 5-6 numbers) and think about dominated strategies.
3. BP and ExxonMobil are engaged in negotiations regarding a new exploration. Simultaneously BP can choose to play Tough (T) or soft (S), while ExxonMobil can opt for Intransigent (I) or Acquiesce (A). The payoffs are as follows. If the choices are T and I, the payoffs are (5, 1) to BP and ExxonMobil, respectively. If the choices are S and I the payoffs are (6, 2) for BP and ExxonMobil, respectively. If the actions of the firms are T and A, the payoffs are (3, 3), and if the actions are S and A, then the payoffs are (4, 4). Which of the following statements are true? BP has a dominant strategy play S. The Nash equilibrium is (S, A) ExxonMobil has a dominant strategy to play A. The dominant strategy equilibrium is (S, A) These negotiations resemble a prisoners’ dilemma.