Player 1 B L 8 9 Player 2 8 0 R 0 1 9 1 Collusion 5. Consider the following game and suppose that it is repeated an infinite number of times. Players have a discount value of 8. (a) For what values of 8 can collusion on (T,L) be sustained under the following grim trigger strategy: Play (T,L) if (T,L) has been played in all previous periods Otherwise play (B,R).

Player 1 B L 8 9 Player 2 8 0 R 0 1 9 1 Collusion 5. Consider the following game and suppose that it is repeated an infinite number of times. Players have a discount value of 8. (a) For what values of 8 can collusion on (T,L) be sustained under the following grim trigger strategy: Play (T,L) if (T,L) has been played in all previous periods Otherwise play (B,R).

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 2MC

See similar textbooks

Similar questions

GAME ZZZ B1 Player B A1 30, 30 Player A A2 20, 40 B2 40, 20 35, 35 In the Game ZZZ (see table above), all payoffs are listed with the row player's payoffs first and the column player's payoffs second. In this game, neither player has a dominant strategy. the Nash equilibrium does not maximize the total payoff. there is no Nash equilibrium. the Nash equilibrium maximizes the total payoff.
Paramter y = 0 What is the highest payoff any player can receive in any subgame perfect Nashequilibrium of the repeated game?
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.
Consider the following voting game. There are three players, 1, 2 and 3. And there are three alternatives: A, B and C. Players vote simultaneously for an alternative. Abstaining is not allowed. Thus, the strategy space for each player is {A, B, C}. The alternative with the most votes wins. If no alternative receives a majority, then alternative A is selected. Denote ui(d) the utility obtained by player i if alternave d {A, B, C} is selected. The payoff functions are, u1 (A) = u2 (B) = u3 (C) = 2 u1 (B) = u2 (C) = u3 (A) = 1 u1 (C) = u2 (A) = u3 (B) = 0 a. Let us denote by (i, j, k) a profile of pure strategies where player 1’s strategy is (to vote for) i, player 2’s strategy is j and player 3’s strategy is k. Show that the pure strategy profiles (A,A,A) and (A,B,A) are both Nash equilibria. b. Is (A,A,B) a Nash equilibrium? Comment.
The ultimatum game is a game in economic experiments. The first player (the proposer) receives a sum of money and proposes a fair proposal (F - 5;5) or unfair proposal (U - 8;2). The second player (the responder) chooses to either accept (A) or reject (R) this proposal. If the second player accepts, the money is split according to the proposal. If the second player rejects, neither player receives any money. 1 A 5:5 2 F R 0:0 U A 8:2 2 1. Find the subgame perfect Nash Equilibrium using backward induction. R 0;0
• (1,0) (1,1) Player 2 G D H (2,0) Action Player 1 Player 1 Action B Player 1 (3,-1) E Player 2 (0,1) (-1,-1) (a) Find all the Subgame Perfect Nash equilibria in this game. (b) Find all the Nash equilibria in this game. (Hint: write the game in strategic form.)
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.
Paramter y = 0 If ⟨a, d⟩ is played in the first period and ⟨b, e⟩ is played in the second period, whatis the resulting (repeated game) payoff for the row player?
In Homework 1, we saw that there is no strict dominant strategy equilibrium in an inspection game. Thus, the players must randomize and play a mixed strategy in equilibrium. Suppose the agent shirks with probability p₁ and works with probability (1 - p₁), while the principal inspects with probability p2 and does not inspect with probability (1-P2). Find the mixed strategy equilibrium for this game. I NI S (0, -k) (w, -w) W (w c, p-w-k)| (wc, p-w) Table 1: Payoff matrix for the inspection game
(b) Consider the following game. 2 L M H L 4,4 2,4 1,5 1 M 4,2 3,3 0,2 H 5,1 2,0 0,0 Suppose the game above is played twice. The players do not discount the future (i.e. the discount factor for each player is 8 = 1). Describe a subgame-perfect equilibrium of this twice- repeated game in which players play (L, L) in period 1. Consider an auction for a single object with N> 1 symmetric, risk-neutral bidders whose private valuations vi, i = {1,..., N}, are independent draws from a given distribution F on the in- terval [0, 1]. Prove that in a sealed-bid second-price auction (i.e. Vickrey auction), bidding true value is a weakly dominant strat- egy for any bidder.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A.