Quantitive decision making 3. Consider a two-person zero-sum game with the reward matrix given. Suppose f >d 2b> a 2c> ewhere all the values are integer numbers.a. What is the optimal strategy for the column player? Explain.b. Under which conditions, which strategies will be chosen by the row player?Also, state the probabilities of mixed strategies. Explain.ab.dfe

Answered: Image /qna-images/answer/0cf8ae74-b9b0-42f8-93d2-f7cc66760aed.jpg

3. Consider a two-person zero-sum game with the reward matrix given. Suppose f >d b>a2c>e where all the values are integer numbers. a b What is the optimal strategy for the column player? Explain. b. Under which conditions, which strategies will be chosen by the row player? Also, state the probabilities of mixed strategies. Explain. a. f e

3. Consider a two-person zero-sum game with the reward matrix given. Suppose f >d b>a2c>e where all the values are integer numbers. a b What is the optimal strategy for the column player? Explain. b. Under which conditions, which strategies will be chosen by the row player? Also, state the probabilities of mixed strategies. Explain. a. f e

Microeconomics: Principles & Policy

14th Edition

ISBN:9781337794992

Author:William J. Baumol, Alan S. Blinder, John L. Solow

Publisher:William J. Baumol, Alan S. Blinder, John L. Solow

Chapter13: Between Competition And Monopoly

Section: Chapter Questions

Problem 10DQ

See similar textbooks

Similar questions

A st SW B st 2,1 5, 15 2. Consider the game of chicken above. SW 11,4 3,5 a. Find all Nash equilibrium in pure strategies. b. Say that player A uses a mixed strategy, where she picks st with prob. 0.55 and sw with prob. 0.45. What is B's expected payoffs from choosing pure st and pure sw? c. Player B uses a mixed strategy and wants A to choose sw. What is the minimum prob. p, for which B needs to play st so A will choose sw.
Exercise 6.8. Consider the following extensive-form game with cardinal payoffs: 1 R O player pay 000 2 1 M 3 b 010 O player 3's payoff 1 2 221 2 000 0 0 (a) Find all the pure-strategy Nash equilibria. Which ones are also subgame perfect? (b) [This is a more challenging question] Prove that there is no mixed-strategy Nash equilibrium where Player 1 plays Mwith probability strictly between 0 and 1.
a. Consider the following sequential game. Player 1 A B Player 2 Player 1 a a B Player 2 (4) () y i. Determine the subgame perfect Nash equilibria and their outcomes. ii. Determine the Nash equilibria of the game. For each of the Nash equilibria, argue why no player has a profitable deviation. ii. Determine which parts of the Nash equilibrium strategies involve uncredible threats.
In this game, which of the following claim is wrong: X с D с D 2 3 Veuillez choisir une réponse. a. 2 0 0 1 3 1 This game is similar to the prisoner dilemma. b. Players do not always play the same best response. C. A the Nash equilibrium, the gains for each player is smaller than for other outcomes. d. D is a dominant strategy for player 1.
Player 1 Cooperate (C) Defect (D) Cooperate (C) 3,3 8,0 Player 2 Defect (D) 0,8 1,1 In general, a combination of strategies is a Nash equilibrium if ... Every player is choosing a best response against the other players' strategies. Every player has a positive payoff. The players maximize the sum of their payoffs. The players choose identical strategies. If the game is repeated, which cooperative actions could benefit both players? O Both players choose C. Player 1 chooses C, Player 2 chooses D. O Player 1 chooses D, Player 2 chooses C. Both players choose D.
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.
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.
on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
Use the following payoff matrix for a simultaneous-move one-shot game to answer the accompanying questions. Player 2 Strategy C D E F Player 1 A 9, 8 14, 14 18, 25 12, 19 B 23, 13 10, 18 14, 26 19, 21 a. What is player 1’s optimal strategy? multiple choice Strategy B Strategy A Player 1 does not have an optimal strategy. b. Determine player 1’s equilibrium payoff. Prev
Player 1 U D L 3,3 5,0 Player 2 R 0,5 1,1 a. Find the Nash equilibria, if any, in the game above. For each equilibrium, justify why it is a Nash equilibrium in a few sentences. b. Suppose this game was to be played infinitely many times between the two players. Find a condition for 8 such that the Pareto-optimal outcome can be attained. Find this for both players playing Grim Trigger in the infinite game.
Consider the strategic form game shown. a. Assume that both players are rational. What happens?b. Assume that both players are rational and that each believes that theother is rational. What happens?c. Find the strategies that survive the ISDS.
This payoff matrix shows a two-player variant of the sushi game, but where B really loves sushi, so her payoffs from getting to eat sushi are higher than A's, and her payoffs from there not being enough sushi are lower than A's. Payoffs are ordered A, B. В A 10, 15 10, 25 20, 15 0, -5 A. Find and state all of the mixed strategy Nash equilibria of the game. If there are multiple equilibria, number them in preparation for answering part "c." B. (From the week 6 lectures) Draw a graph of the expected payoffs for each player. Use these graphs to formulate the decision rule for each player. C. (From the week 6 lectures) Draw a graph of the best replies of the two players. Carefully label each Nash equilibrium.