Consider the game having the following normal form. Which of the following strategies of the row player is a dominant strategy? COLUMN PLAYER B 6, 5 -5, 11 7,9 ROW PLAYER Y 10, 6 7, 10 11, 9 11, 7 -4, 11 8, 4 11, 3 -1, 10 7,8 OY OZ O No dominant strategy

Consider the game having the following normal form. Which of the following strategies of the row player is a dominant strategy? COLUMN PLAYER B 6, 5 -5, 11 7,9 ROW PLAYER Y 10, 6 7, 10 11, 9 11, 7 -4, 11 8, 4 11, 3 -1, 10 7,8 OY OZ O No dominant strategy

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

6. Consider the following two-player game: 2 L M U 3,3 2,3 1 M 2,1 3,1 D R 0,2 3,3 0,3 3,0-5, -5 a. Find all pure NE. b. Find a (non-pure) MNE in which player 1 (the row player) plays a pure strategy. c. (Harder Question) Show that there cannot be a CE prescribing that strat- egy D of player 1 (the column player) is played with positive probability.
age Which of the following statements is the best description of a Nash equilibrium? Select one: O a. An equilibrium outcome achieved by cooperation between players in the game b. An outcome that is achieved when players in the game have jointly maximized profits and divided those profits according to market share of each player O c. An outcome where each player's strategy depends on the behaviour of its opponents d. An outcome where each player's best strategy is to maintain its present behaviour given the present behaviour of the other players Next page
Use the following game table to answer the question: Player 2 Y A 10, 5 6, 3 0,0 Player 1 B 2,6 1, 3 0,0 3,5 3, 4 3, 3 One of these players has a strictly dominant strategy. Which player, and what strategy is it? Player 2; Y Player 1; A Player 2; X O Player 1; B O Player 1; X
3. Nash Equilibria Consider the following (normal-form) game. Compute a Nash Equilibrium of this game. U C D L | M R 5,0 1,3 4,0 2,4 1,4 3,5 0,1 1,0 5,0
What is the SPNE of the following game, where Player 1 moves first and can play A or B, and player 2 moves second and can play X or Y? Player 1 A B Player 2 Y 3,1 2, 3 1, 2 1, 2 >
1. Consider the following game matrix. Player A Answer: Top Bottom Left a, b e, f Player B Right c, d g, h (a) If top and left are strictly dominant strategies, then what do we know the relationship of the parameters? (b) If (top, left) is a Nash equilibrium, then what do we know the relationship of the parameters? Answer: (c) If top and left are strictly dominant strategies, will (top, left) be a Nash equilibrium? Why? Answer: (d) If (top, left) is a Nash equilibrium, must the strategies be strictly dominant strategies? Why? Answer:
GAME 5 Player B B1 B2 Player A A1 7,3 | 5, 10 A2 3, 8| 9, 6 In Game 5 above, O Neither player has a dominant strategy. O Player B has a dominant strategy. O Player A has a dominant strategy. O Both players have dominant strategies.
on Mary, UE, BD UF, AC DF, BC UF, BD DE, AC DE, BC Nancy U D Nancy -5,4 Mary -0,2 -6,2 -2.6 Which of the following answers is a subgame perfect Nash equilibrium in this game? Check all that apply. (Answers below are formatted as Mary's strategy, Nancy's strategy.)
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.
1. The table below shows a prisoner's dilemma in normal form. Players 1 and 2 each choose between D and C. D C D 2,2 1,10 10, 1 5,5 Answer the following questions. Remember to explain your reasoning. (a) If the game is played only once, what is the equilibrium in dominant strategies? (b) If the game is played three times in a row, what action does each player choose in every round? Suppose that the game is repeated indefinitely. The players do not discount the future. How- ever, the game ends with probability p € (0, 1) after each round. Assume that each player uses the following grim-trigger strategy. Each player chooses C in the first round. Each player chooses C in the current round if both players chose C in every previous round. Each player chooses D in the current round if either player chose D in some previous round. (c) If p = 1, is it optimal for each player to use the grim-trigger strategy above given that the other player uses the grim-trigger strategy above? [Hint: compare…
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…
1. Static and Dynamic Game. Consider the following 2-by-2 game: C D 1A (1,10) (1,1) B (2, a) (0,1) (a) erwise, find the pure-strategy Nash equilibria, if any of this game. (There is no need to look for equilibria in mixed strategies) Assume for now that a = 2. Using dominant strategies or oth- (b) Now, consider the dynamic game in which player 1 moves before player 2, and the payoffs remain unchanged. i.: possible strategies for each player? Recall that a strategy profile for a player not at the initial node of the game tree must specify an action for the player at every node. Draw the game tree for this dynamic game. What are the ii "Find the backward-induction solution(s) to this game. Calculate the equilibrium payoffs for each player. Com- pared to the simultaneous game, is there a first-mover advantage or a ii. second-mover advantage? (c) Now, assume that a = 0 in the original static game. i. Find all the Nash equilibria in pure and mixed strategies. Denoting p the probability…