.Each of Player 1 and Player 2 chooses an integer from the set {1, 2, ..., K}. If they choose the same integer, P1 gets +1 and P2 gets -1; if they choose different integers, P1 gets -1 and P2 gets +1. (a) Show that it is a NE for each player to choose every integer in {1, 2, ..., K} with equal probability, K1 . (b) Show that there are no NE besides the one you found in (a).

.Each of Player 1 and Player 2 chooses an integer from the set {1, 2, ..., K}. If they choose the same integer, P1 gets +1 and P2 gets -1; if they choose different integers, P1 gets -1 and P2 gets +1. (a) Show that it is a NE for each player to choose every integer in {1, 2, ..., K} with equal probability, K1 . (b) Show that there are no NE besides the one you found in (a).

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter7: Uncertainty

Section: Chapter Questions

Problem 7.3P

See similar textbooks

Similar questions

(b) Consider the simultaneous-move game below with two players, 1 and 2. Each player has two pure strategies. If a player plays both strategies with strictly positive probability, we call it a strictly mixed strategy for that player. Show that there is no Nash equilibrium in which both 1 and 2 play a strictly mixed strategy. Player 2 b₁ b₂ Player 1 a₁ 3,0 0,1 a2 2,1 2,1
Player 2 Y1 Y2 Y3 X1 1,4 8,4 7,4 6,2 4,5 Player 1 X2 3,5 3,5 X3 5,3 2,2
Player 2 Y1 1,4 3,5 5,3 X1 Y2 Y3 Player 1 8,4 7,4 6,2 X2 4,5 3,5 2,2 X3 For the game given above, ((p1.p2,p3).(q1.q2.q3) is a mixed strategy: The first triplet is Player 1's probability allocations to X1, X2. X3. The second triplet is Player 2's probability allocations to Y1, Y2. Y3. Which of the following is true? O a. There are only pure NEs in this game O b. ((p1,p2.p3).(q1.q2.q3))- ((1/3,1/3,1/3)(1/3.0.2/3) is a mixed NE Oc (pt.p2.p3).(q1.q2.q3))- ((1/3.2/3,0)(1/3,1/3,1/3)) is a mixed NE O d. No action is strictly dominated by some mixed strategy 到
a W 3,5 3,4 8,4 0,0 3,3 8,9 y 0,1 5,9 9,8 Describe a strategy for player 1 that dominates x. O (1/3.0. 2/3) 1.0,0) O01.1) to
(ii) A mixed strategy profile (p, q) is one in which p = (p,P2.... P) is the mixed strategy of player 1, and q- (g1, q2,..q4) is the mixed strategy of player 2. Show that if p, >0 in a Nash equilibrium profile (p*, q*), the player 2 must also play i with strictly positive probability q'; > 0. (State clearly any theorem you use to show this. You are not required to justify the theorem.) %3D
Consider a situation of after-match penalty shoot-out. The striker can target either East or West side of the goal. If he targets West, with 80% chance he shoots on target. If he shoots East, he is accurate with 75%. The goalkeeper has to choose the corner to jump to. If he does not guess the corner correctly and the shot is on target, then the striker scores. If the striker shoots West, the shot is on target and the goalkeeperjumps West, then with 75% chance he saves the goal. If the striker shoots East, the shot is on target and the goalkeeper jumps East, then with chance of 2/3 he saves the goal. Suppose, that it is a zero-sum game and if the striker scores his payoﬀ is 1, otherwise it is 0.1. Formulate this situation as a strategic game and Find all Nash equilibria of the game.
(a) Stan and Ollie are two students who share a flat. Both of them prefer to live in a clean flat. However, neither is too fond of housecleaning. Each of them receives a payoff of 12 if they both clean the flat. If neither person cleans the flat, they receive a payoff of 6 each. If one person cleans the flat but the other person does not, then the payoff for the person who does the cleaning is 5 and the payoff for the person who doesn't do any cleaning is 15. (i) Write down the payoff matrix of this game. Derive the dominant strategy equilibrium. Is this also a Nash equilibrium? (ii) Expiain your reasoning. Consider a game with N players. Each player chooses Black or White. If a player (b) chooses Black, she gets 100 if everyone else also chooses Black, and she gets 0 if any of the other players does not choose Black. If a player chooses White, she always gets 50. Show that everyone choosing Black and everyone choosing White are both Nash equilibria of this game.
7. N [0.75] B A [0.25] 1 E F 6 2 J K J K 12 3 9. 6 6. 1 In equilibrium, what is the probability that player 1 will use the pure strategy E in this game?
EXERCISE 3.a. Show that if G; has value v; for i = 1, 2, then their series-sum game has value v₁ + v₂.
In a mixed strategy equilibrium of the game below, what is the probability with which Player 2 chooses r (if there are multiple equilibria with different probabilities of a, choose any one)? Player 2 y a 3, 3 4, 2 Player 1 b 6,3 2, 6 5. 3 3, 2 Numerical answer
With what probability does player 1 play Down in the mixed strategy Nash equilibrium? (Input your answer as a decimal to the nearest hundredth, for example: 0.14, 0.56, or 0.87). PLAYER 1 Up Down PLAYER 2 Left 97,95 47, 33 Right 8,43 68,91
If Firm 1 chooses to release the console in October with probability of 0.692 or December with a probability of 0.308, then Firm 2 is indifferent between choosing a release date. If Firm 2 released the console in October with probability of 0.50 or December with a probability of 0.50, then Firm 1 is indifferent between choosing a release date Suppose now that instead of choosing the release date at the same time, the firms choose sequentially (but still in advance). Firm A chooses its release date first, then firm B observes that date and chooses its own date. Thepayoffs are otherwise the same as above. Represent the game tree corresponding to this dynamic game.