4. Consider the following extensive-form version of the Prisoner's Dilemma. In this version, Player 1 takes an action first. Player 2 then learns about Player 1's action and takes an action accordingly. The payoffs are represented as (7₁, 72), where 7₁ is Player 1's payoff and 72 is Player 2's payoff. Player 1 Speak Player 2 Silence Silence Player 2 Speak Speak (-8,-8) (0, -10) (-10,0) Which outcome is most likely to happen in the end of the game? (a) Player 1 plays Speak, Player 2 plays Speak (b) Player 1 plays Speak, Player 2 plays Silence (c) Player 1 plays Silence, Player 2 plays Speak (d) Player 1 plays Silence, Player 2 plays Silence (e) None of the above Answer: 4a. Silence (-1,-1)

4. Consider the following extensive-form version of the Prisoner's Dilemma. In this version, Player 1 takes an action first. Player 2 then learns about Player 1's action and takes an action accordingly. The payoffs are represented as (7₁, 72), where 7₁ is Player 1's payoff and 72 is Player 2's payoff. Player 1 Speak Player 2 Silence Silence Player 2 Speak Speak (-8,-8) (0, -10) (-10,0) Which outcome is most likely to happen in the end of the game? (a) Player 1 plays Speak, Player 2 plays Speak (b) Player 1 plays Speak, Player 2 plays Silence (c) Player 1 plays Silence, Player 2 plays Speak (d) Player 1 plays Silence, Player 2 plays Silence (e) None of the above Answer: 4a. Silence (-1,-1)

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

9. For the payoff matrix below, consider a sequential version of the game in which Player 2 moves first and then Player 1 moves second. Which of the following is not a correct statement? Player 1 Top Center Bottom Left 1,2 5,1 6,0 Player 2 Middle 7,1 11,2 -4,3 Right 10,4 1,0 8,5 The subgame perfect payoffs coincide with those of a Nash equilibrium b. Depending on Player 2's move, Player 1 will sometimes optimally choose Bottom c. Player 2 will choose Right in the subgame perfect equilibrium d. Player 2 would be willing to pay a positive $ amount to move first rather than second e. Player 1 would be willing to pay a larger $ amount than Player 2 to move first
1. Consider the zero-sum game given by 3 1 2 A = 4 0 2 1 2 -2 3 1 (a) Calculate the gain floor and loss ceiling for A. (b) Without using dominance, use the Equilibrium Theorem to determine whether it is possible for A to have a mixed Nash Equilibrium where player two's strategy is of the form (a, b, c, 0) with a, b, c > 0.
5
Table 8. This table shows a game played between two players, A and B. The payoffs are given in the table as (Payoff to A, Payoff to B). A Select one: Up Middle Down Left (4,2) a. Middle-Center O b. Down-Center (3, 1) (1,3) B Center (2,5) (5, 3) (4,4) Refer to Table 8. This table shows a game played between two players, A and B. The payoffs in the table are shown as (Payoff to A, Payoff to B). Which of the following outcomes represents a Nash equilibrium in the game? Right (3, 3) (5,2) (6, 1) O c. Up-Left O d. More than one of the above is a Nash equilibrium in this game.
Mr. and Mrs. Ward typically vote oppositely in elections and so their votes “cancel each other out.” They each gain two units of utility from a vote for their positions (and lose two units of utility from a vote against their positions). However, the bother of actually voting costs each one unit of utility. Diagram a game in which they choose whether to vote or not to vote.
2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. TTTT Player 1 Player 2 Player 1 Player 2 (3, 3) t (1, 1) (0, 3) (2, 2) (1, 4) (a) List all possible strategies of each player. (b) Transform the game tree into a normal-form matrix representation. (c) Find all pure-strategy Nash equilibria. (d) Find the unique pure-strategy subgame-perfect equilibrium.
7
7. Solving for dominant strategies and the Nash equilibrium Suppose Gabriel and Nia are playing a game that requires both to simultaneously choose an action: Up or Down. The payoff matrix that follows shows the earnings of each person as a function of both of their choices. For example, the upper-right cell shows that if Gabriel chooses Up and Nia chooses Down, Gabriel will receive a payoff of 6 and Nia will receive a payoff of 4. Gabriel Up Down Up 6,3 3,3 Nia Down 6, 4 7,4 In this game, the only dominant strategy is for to choose The outcome reflecting the unique Nash equilibrium in this game is as follows: Gabriel chooses and Nia chooses
1. Consider a game of chicken: two players approach a narrow bridge with room only for one, and each chooses either to go through and hope the other guy backs off (call this action H, for "hawk"), or backs off to let the other go through (call this action D, for "dove"). If both players are normal, then each gets a payoff of -1 from a collision (i.e. if both choose H), 1 if they choose H against D, 0 if they choose D (regardless of what the other player chooses). Now perturb the game as follows: there is a chance p > 0 that P2 is a “violent type", who gets 1 from playing H regardless of Pl's action, and -1 from playing D, again regardless of P1's action. (a) Illustrate the game tree corresponding to the Harsanyi transformation of this game (i.e. the dynamic game of imperfect information in which nature moves first). (b) Illustrate the extended game (i.e. the normal form game corresponding to your game tree in part (a)). (c) Find all values of p for which there is a BNE in which P1…
Consider the following game: