Question 1Saue AnsweConsider a 2-player game with strategy sets S1-(a,b}for player 1 and Sz =(c,d) for player 2. Which statement is true if player 1 has no dominant strategy?O Strategy b guaranteos playor 1 the best possible payaff, no matter what strategy player 2 choosos.O Depending on what strategy player 2 chooses, sometimes strategy a leads to a (weakly) higher payoff for player 1 than strategy b, and sometimes strategy b leads to a (weakiy)higher payoff for player 1 than strategy a.O We cannot say whether any of the other 3 alternatives is true.O Strategy a guarantees player 1 the best possible payoff, no matter whhat strategy player 2 chooses.

A dominant strategy is such a strategy that a player chooses every time, no matter the strategy…

Question 1 Sa A Consider a 2-player game with strategy sets S - (a,b}for player 1 and Sz={c,0) for player 2. Which statement is true if player 1 has no dominant strategy? O Strategy b guaranteos player 1 the best possible payoff, na matter what strategy playor 2 chooses. O Depending on what strategy player 2 chooses, somesimes strategy a leads to a (weakhy) higher payoff for player 1 than strategy b, and sametimes strategy b leads to a (weakiy) higher payoff for player 1 than strategy a. O We cannot say wthether any of the other 3 alternatives is true. O Strategy a guarantees player 1 the best possible payoif, no matter what strategy player 2 chooses.

Question 1 Sa A Consider a 2-player game with strategy sets S - (a,b}for player 1 and Sz={c,0) for player 2. Which statement is true if player 1 has no dominant strategy? O Strategy b guaranteos player 1 the best possible payoff, na matter what strategy playor 2 chooses. O Depending on what strategy player 2 chooses, somesimes strategy a leads to a (weakhy) higher payoff for player 1 than strategy b, and sametimes strategy b leads to a (weakiy) higher payoff for player 1 than strategy a. O We cannot say wthether any of the other 3 alternatives is true. O Strategy a guarantees player 1 the best possible payoif, no matter what strategy player 2 chooses.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
** Please be advsed that this is practice only from previous yeasr *** Answers: (a) There are no Nash equilibria.(b) There are two pure strategy Nash equilibra, one with (H,H) and another with (L,L), and no mixed strategy Nash equilibria.(c) There are two pure strategy Nash equilibra, one with (H,H) and another with (L,L), and one mixed strategy Nash equilibria with p = 1/2 and q = 1/2.(d) There are two pure strategy Nash equilibra, one with (H,H) and another with (L,L), and one mixed strategy Nash equilibria with p = 1/2 and q = 3/4.(e) There are two pure strategy Nash equilibra, one with (H,H) and another with (L,L), and one mixed strategy Nash equilibria with p = 3/4 and q = 1/2.
a) Find the Nash equilibria in the game (in pure and mixed strategies) and the associated payoffs for the players. b) Now assume that the game is extended in the following way: in the beginning Player 1 can decide whether to opt out (this choice is denoted by O) or whether to play the simultaneous-move game in a) (this choice is denoted by G). If Player 1 opts out (plays O) then both Player 1 and Player 2 get a payoff of 4 each and the game ends. If Player 1 decides to play G, then the simultaneous-move game is played. Find the pure-strategy Nash equilibria in this extended version of the game. (Hint: note that Player 1 now has 4 strategies and write the game up in a 4x2 matrix.) c) Write the game in (b) up in extensive form (a game tree). Identify the subgames of this game.
You and a rival are engaged in a game in which there are three possible outcomes: you win, your rival wins (you lose), or the two of you tie. You get a payoff of 50 if you win, a payoff of 20 if you tie, and a payoff of 0 if you lose. What is your expected payoff in each of the following situations? (a) There is a 50% chance that the game ends in a tie, but only a 10% chance that you win. (There is thus a 40% chance that you lose.) (b) There is a 50–50 chance that you win or lose. There are no ties. (c) There is an 80% chance that you lose, a 10% chance that you win, and a 10% chance that you tie.
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
Consider the location game we covered in Lecture 3. Now assume there arethree players (vendors). As we assumed in the lecture, consumers in each area choosethe closest vendor and if there are multiple closest vendors then these vendors receiveequal share of consumers in the area. Notice Si = {1, 2, 3, ...., 9} for i = 1, 2, 3. Here aresome examples of payoffs: u1(1, 1, 1) = 3, u1(1, 1, 9) = u2(1, 1, 9) = 2.25, u3(1, 1, 9) =4.5, u1(1, 5, 9) = u3(1, 5, 9) = 2.5 and u2(1, 5, 9) = 4. (a) Is s′1 = 1 strictly dominated by s′′1 = 2 for player 1?(b) Is s′1 = 1 weakly dominated by s′′1 = 2 for player 1?(c) Can you find a Nash equilibrium in pure strategies?
answer the ff: Suppose that each company cancharge either a high price for tickets or a low price. Ifone company charges $300, it earns low profit if theother company also charges $300 and high profit ifthe other company charges $600. On the other hand,if the company charges $600, it earns very low profit ifthe other company charges $300 and medium profitif the other company also charges $600.a. Draw the decision box for this game.b. What is the Nash equilibrium in this game?Explain.c. Is there an outcome that would be better than theNash equilibrium for both airlines? How could itbe achieved? Who would lose if it were achieved?
Consider the following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
Consider the following coordination game: Player 2P1 Comedy Show Concert Comedy Show 11,5 0,0 Concert 0,0 2,2 a. Find the Nash equilibrium(s) for this game.b. Now assume Player 1 and Player 2 have distributional preferences. Specifically, both people greatly care about the utility of the other person. In fact, they place equal weight on their outcome and the other person’soutcome, ρ = σ = ½. Find the Nash equilibrium(s) with these utilitarianpreferences.c. Now consider the case where Player1 and Player2 do not like each other. Specifically, any positive outcome for the other person is viewed as anegative outcome for the individual, ρ = σ = -1. Find the Nashequilibrium(s) with these envious preferences.
8. Two states, A and B, have signed an arms-control agreement. This agreementcommits them to refrain from building certain types of weapons. The agreement is supposed tohold for an indefinite length of time. However, A and B remain potential enemies who wouldprefer to be able to cheat and build more weapons than the other. The payoff table for A (player1, the row player) and B (player 2, the column player) in each period after signing thisagreement is below. a) First assume that each state uses Tit-for-Tat (TFT) as a strategy in this repeated game.The rate of return is r. For what values of r would it be worth it for player A to cheat bybuilding additional weapons just once against TFT? b) For what values of r would it be worth deviating from the agreement forever to buildweapons? c) Convert both values you found in parts a and b to the equivalent discount factor dusing the formula given in lecture and section. d) Use the answers you find to discuss the relationship between d and r:…
Consider the game with the payoffs below. Which of the possible outcomes are MORE efficient than the Nash Equilibrium (NE)? Note, they do NOT need to be Nash equilibria themselves, they just need to be more efficient than the NE. Multiple answers are possible, but not necessary. You need to check ALL correct answers for full credit. JILL High Medium LowMAGGIE Left 3,4 2,3 2,2Center 4,8 9,7 8,7Right 7,6 8,5 9,4Group of answer choices (Left, Low) There is no strategy combination that is more efficient than the Nash equilibrium for this game. (Right, Medium) (Left, High) (Center, Medium) (Center, High) (Center, Low) (Left, Medium) (Right, Low) (Right, High)
Mohamed and Kate each pick an integer number between 1 and 3 (inclusive). They make their choices sequentially.Mohamed is the first player and Kate the second player. If they pick the same number each receives a payoff equal to the number they named. If they pick a different number, they get nothing. What is the SPE of the game? a. Mohamed chooses 3 and Kate is indifferent between 1, 2 and 3. b. Mohamed chooses 3 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2, and 3 if Mohamed chooses 3. c. Mohamed chooses 1 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2 and 3 if Mohamed chooses 3. d. Mohamed chooses 3 and Kate chooses 3.