Two players, Player 1 and Player 2, are playing a repeated prisoner’s dilemma. Payoffs are described in the following matrix. Answer which statement is correct: Select one: a. A trigger strategy will never support (A,A) as an equilibrium b. A tit-for-tat strategy will never support (A,A) as an equilibrium c. A tit-for-tat strategy will support (A,A) as an equilibrium if δ > 0.7 d. A trigger strategy will support (A,A) as an equilibrium if δ > 0.7

Two players, Player 1 and Player 2, are playing a repeated prisoner’s dilemma. Payoffs are described in the following matrix. Answer which statement is correct: Select one: a. A trigger strategy will never support (A,A) as an equilibrium b. A tit-for-tat strategy will never support (A,A) as an equilibrium c. A tit-for-tat strategy will support (A,A) as an equilibrium if δ > 0.7 d. A trigger strategy will support (A,A) as an equilibrium if δ > 0.7

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

Which of the following is FALSE for the grim trigger strategy and the infinite horizon repeated Prisoner's Dilemma game illustrated above? A. In the grim trigger strategy profile, if a player chooses D in a period, then both players chooses D forever after that period B. The threshold discount factor for sustaining cooperation under grim trigger strategy depends on the utility numbers in the stage game C. If all utility numbers remain the same but 3 is replaced by 5 in the stage game, then cooperation CANNOT be sustained in this game for all possible values of the discount factor.
Consider a modification of driving conventions, shown in the figure below, in which each player has a third strategy: to zigzag on the road. Suppose that if a player chooses zigzag, the chances of an accident are the same whether the other player drives on the left, drives on the right, or zigzags as well. Let that payoff be 0, so that it lies between –1, the payoff when a collision occurs for sure, and 1, the payoff when a collision does not occur. Find all Nash equilibria.
Consider the following sequential strategic situation, called the centipede game. The game has 100 stages. Two players take turns making decisions, starting with player 1. At stage t = 1,...,99, player 1 (if the stage is odd) or player 2 (if the stage if even) chooses whether to "Terminate the game" or to "Continue the game." If the game is terminated instage t = 1,...,99, the player terminating the game receives a payoff of t, while the other player receives a payoff of zero. Finally, at stage t = 100, player 2 chooses between action A with a payoff of 99 for each player, or action B with a payoff of zero for player 1 and a payoff of 100 for player 2. Draw the game tree for this situation. What is the SPNE?
Consider the three-player game shown. Player 1 selects a row, either a1, b1 or c1. Player 2 selects a column, either a2 or b2. Player 3 selects a matrix, either a3 or b3. The first number in a cell is player 1’s payoff, the second number is player 2’s payoff, and the last number is player 3’s payoff. Derive the strategies that survive the IDSDS.
Consider a coordination game where each of two agents picks a number between 1 and 1000. The players get a prize of $1000 each if their numbers are the same, and $0 otherwise. In this game, there exists(A) a thousand of pure-strategy Nash equilibria;(B) an iterated dominant-strategy equilibrium;(C) a dominant strategy equilibrium;(D) none of the above.
Olivia is thinking about opening a new bakery (the entrant). There is already a bakery open in her neighborhood (the incumbent), and the owner of the incumbent bakery makes it clear that if Olivia enters the market, they will cut their prices in an attempt to drive the new bakery out of business. Based on the payoff matrix below, is the incumbent’s threat credible? That is, if Olivia opens a new bakery, will the incumbent actually lower their prices? Note: the entrant chooses the row, the incumbent chooses the column High price Low price Enter 1, 2 -1, 1 Don’t enter 0, 10 0, 1 a. Yes, the threat is credible b. No, the threat is not credible