Question

In: Economics

You are matched with someone and each of you chooses R or B. The payoffs are...

You are matched with someone and each of you chooses R or B. The payoffs are determined as follows. If you each play your red card, you will each earn $10.If you each play the black card, you will each earn $20. If you play your black card and the other person plays red, then you earn $0 and the other person earns $30. If you play red and the other person plays black, then you earn $30and the other person earns nothing.

(a)Express the game in matrix form. [5pts]

(b)Find all the Nash equilibria (possibly involving mixed strategies). [5pts]

(c)Derive the set of the subgame perfect equilibria when you play this game T times with the same student. [5pts]

(d)For what values of the discount factor does the combination of the follow-ing trigger strategies form a subgame-perfect Nash equilibrium when thetwo students play the game repeatedly infinitely many times? [10pts]

ait= (B if t= 1 or both players have observed (a1t0, a2t0) = (B,B) for all t' ≤ t−1; R otherwise), where ait is player i’s action at the t th stage.

Solutions

Expert Solution

Let the red card played be represented by R and the black card be represented by B. There are two players in the game. The first player is 'You' and the second player is 'Other person '.The game matrix for this game is shown below :-

The image clearly shows the strategies played by the two players. To determine the Nash equilibrium, let us consider that the 'other person ' plays R then the dominant strategy for 'You ' is to play R because it gives a pay off of 10 whereas playing B gives a payoff of 0. Considering the other case, if other person plays B then the dominant strategy for You is play R because it gives a payoff of 30 whereas playing B would give a payoff of 20.

Now, similarly let us consider that You plays R then Other person would play R and if 'You' plays B then also the other person would play R. Therefore, irrespective of each others strategy, the dominant strategy for both players is to play R. Hence, the Nash equilibrium is (R, R) in which both the players get a pay off of (10,10).

Now the subgame perfect nash equilibrium can be determined through the diagram shown below assuming that 'You' moves first.

Through backward induction, it can be said that (R, R) is the sub game perfect nash equilibrium.

If this game would be played T times then the outcome would be same because if a game with unique nash equilibrium is played in a finite number many times then there we will always get the same subgame perfect equilibrium outcome as both players will play their dominant strategy R.

The discount values for which these strategies will converge to sub game perfect nash equilibrium can be determined through this formula-

This sum will be equal to 10

Therefore, the discount factor will be equal to 10/11.


Related Solutions

Player 1 chooses T, M, or B. Player 2 chooses L, C, or R. L C...
Player 1 chooses T, M, or B. Player 2 chooses L, C, or R. L C R T 0, 1 -1, 1 1, 0 M 1, 3 0, 1 2, 2 B 0, 1 0, 1 3, 1 (a) Find all strictly dominated strategies for Player 1. You should state what strategy strictly dominates them. (b) Find all weakly dominated strategies for Player 2.  You should state what strategy weakly dominates them. (c) Is there any weakly dominant strategy for player...
You matched with someone who seemed to be pretty on Tinder/Bumble, you asked them over to...
You matched with someone who seemed to be pretty on Tinder/Bumble, you asked them over to your place for a date. You meet, and they don’t turn out to be as attractive as their pictures made them look. You still proceeded with the date even though you usually do not go out with someone like that (personality wise). Which psychological bias explains your behavior, how is it different than what traditional economics would say?
For each pair a, b with a ∈ R − {0} and b ∈ R, define...
For each pair a, b with a ∈ R − {0} and b ∈ R, define a function fa,b : R → R by fa,b(x) = ax + b for each x ∈ R. (a) Prove that for each a ∈ R − {0} and each b ∈ R, the function fa,b is a bijection. (b) Let F = {fa,b | a ∈ R − {0}, b ∈ R}. Prove that the set F with the operation of composition of...
1. (Level B) Each of n people chooses whether or not to contribute a fixed amount...
1. (Level B) Each of n people chooses whether or not to contribute a fixed amount toward the provision of a public good. The good is provided if and only if at least k people contribute where 2 ≤ k ≤ n; if it is not provided, then the contributions are not refunded. Each person ranks the outcomes from best to worst as follows: (i) Any outcome in which the good is provided and he/she does not contribute. (ii) Any...
Learn by Doing Matched Pairs: In this lab you will learn how to conduct a matched...
Learn by Doing Matched Pairs: In this lab you will learn how to conduct a matched pairs T-test for a population mean using StatCrunch. We will work with a data set that has historical importance in the development of the T-test. Paired T hypothesis test: μD = μ1 - μ2 : Mean of the difference between Regular seed and Kiln-dried seed H0 : μD = 0 HA : μD > 0 Hypothesis test results: Difference Mean Std. Err. DF T-Stat...
1) Provide a set of payoffs in this format a, b      |    c, d e,...
1) Provide a set of payoffs in this format a, b      |    c, d e, f     |     g, i for a 2x2 game that illustrated the problem of free access to guns. 2) Provide a set of payoffs in this format a, b      |    c, d e, f     |     g, i for a 2x2 version of the Battle of the Sexes. 3. In what sense is the Battle of the Sexes a "social dilemma"?
The table below shows the payoffs for two players, A and B, in a one- shot...
The table below shows the payoffs for two players, A and B, in a one- shot simultaneous move game where each player can play either U or D. The first number in each cell is the payoff to player A and the second to player B. Player B U D Player A    U D (5, 5) (6, 0) (0, 6) (2, 2) What is the pure Nash equilibrium of this game? If the game is repeated infinitely many times and...
. Recall from the previous page that for each pair a, b with a ∈ R...
. Recall from the previous page that for each pair a, b with a ∈ R − {0} and b ∈ R, we have a bijection fa,b : R → R where fa,b(x) = ax + b for each x ∈ R. (b) Let F = {fa,b | a ∈ R − {0}, b ∈ R}. Prove that the set F with the operation of composition of functions is a non-abelian group. You may assume that function composition is associative
1. Create the following items in R. Show the R output provided by each object. b...
1. Create the following items in R. Show the R output provided by each object. b The matrix     1 2 3 4 5 6 7 8 9 10 11 12     stored as object mat1. c The matrix     1 5 9 2 6 10 3 7 11 4 8 12     stored as object mat2. d A data frame datfr such that the vector 1 2...
Let R=R+. Define: a+b = ab ; a*b = a^(lnb) 1. Is (R+, +, *) a...
Let R=R+. Define: a+b = ab ; a*b = a^(lnb) 1. Is (R+, +, *) a ring? 2. If so is it commutative? 3. Does it have an identity?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT