Alice and Bob are playing a repeated game in which a certain stage game is played twice in succession. All behaviour in the first period is observed by both players before the second period commences. In the stage game, Alice has 4 pure strategies and Bob has 3 pure strategies. How many pure strategies does Alice have in the repeated game?

Alice and Bob are playing a repeated game in which a certain stage game is played twice in succession. All behaviour in the first period is observed by both players before the second period commences. In the stage game, Alice has 4 pure strategies and Bob has 3 pure strategies. How many pure strategies does Alice have in the repeated game?

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

The count is three balls and two strikes, and the bases are empty. The batter wants to maximize the probability of getting a hit or a walk, while the pitcher wants to minimize this probability. The pitcher has to decide whether to throw a fast ball or a curve ball, while the batter has to decide whether to prepare for a fast ball or a curve ball. The strategic form of this game is shown here. Find all Nash equilibria in mixed strategies.
Two players play the following game for infinite times. For the player to continue to cooperate what would be the ranges of their discount factor, δ_1 and δ_2, respectively? cooperate betray cooperate (10,20) (-25,30) betray (15, -22) (-12, -18)
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?
Two players bargain over 1 unit of a divisible object. Bargaining starts with an offer of player 1, which player 2 either accepts or rejects. If player 2 rejects, then player 1 makes another offer; if player 2 rejects once more, then player 2 makes an offer. If player 1 rejects the offer of player 2, then once more it is the turn of player 1 where he makes two consecutive offers. As long as an agreement has not been reached this procedure continues. For example, suppose that agreement is reached at period 5, it follows that player 1 makes offers in period 1,2 then player 2 makes an o er in period 3, then player 1 makes offers in 4,5. Negotiations can continue indefinitely, agreement in period 't' with a division (x, 1- x) leads to payoffs ( , (1-x)).(The difference from Rubinstein's alternating offer bargaining is that player one makes two consecutive offers, whereas player 2 makes a single offer in her turn.) a. Show that there is a subgame perfect equilibrium in which player 2's…
Consider the game of Chicken in which each player has the option to “get out of the way” and “hang tough” with payoffs: Get out of the way Hang tough Get out of the way 2,2 1,3 Hang tough 3,1 00 a. Find all pure strategy Nash equilibria, if they exist b. Let k be the probability that player 1 chooses “hang tough” and u be the probability that player two chooses “hang tough.” Find the mixed stragety Nash equilibria, if they exist
Consider a game with two players (Alice and Bob) and payoffffs Bob Bob s1 s2 Alice, s1 3, 3 0, 0 Alice, s2 0, 0 2, 2 In the equilibrium in the above game, Alice should (A) always choose the fifirst strategy s1; (B) choose the fifirst strategy s1 with probability 40% ; (C) choose the fifirst strategy s1 with probability 50% ; (D) choose the fifirst strategy s1 with probability 60% .
Using the payoff matrix, suppose this game is infinitely repeated and that the interest rate is sufficiently “low.” Identify trigger strategies that permit players 1 and 2 to earn equilibrium payoffs of 140 and 180, respectively, in each period
Two firms are competing to establish one of two new wireless communication standards, A or B. A strategy is a choice of standard, and an outcome of this game is a choice of standard by each firm – for example, (A, B) represents the case where Firm 1 decides to develop standard A and Firm 2 develops standard B. Here, the first letter will always correspond to Firm 1’s decision, and the second letter to Firm 2’s decision. Firm 1 has the following preferences over outcomes, in order of highest to lowest preferred: it prefers (A, A) to (B, A) to (A, B) to (B, B). Firm 2 prefers (A, B) to (A, A) to (B, A) to (B, B). Suppose that firms simultaneously decide which standard to develop. What is the pure strategy Nash equilibrium?
Two firms are competing to establish one of two new wireless communication standards, A or B. A strategy is a choice of standard, and an outcome of this game is a choice of standard by each firm – for example, (A, B) represents the case where Firm 1 decides to develop standard A and Firm 2 develops standard B. Here, the first letter will always correspond to Firm 1’s decision, and the second letter to Firm 2’s decision. Firm 1 has the following preferences over outcomes, in order of highest to lowest preferred: it prefers (A, A) to (B, A) to (A, B) to (B, B). Firm 2 prefers (A, B) to (A, A) to (B, A) to (B, B). Suppose that firms simultaneously decide which standard to develop. What is the pure strategy Nash equilibrium? Is the answer (B,B)? If not please explian what is the answer?
two players, a and b are playing an asymmetrical game. there are n points on the game board. each turn player a targets a pair of points and player b says whether those two points are connected or unconnected. a can target each pair only once and the game ends when all pairs have been targeted. player b wins if a point is connected with all other points on the very last turn, while player a wins if any point is connected with all other points on any turn but the very last one or if no point is connected to all other points after the last turn. for what values of n does either player have a winning strategy?
There are 3 workers W1,W2,W3. Neither of these workers can be employed alone so that their value for remaining single is 0. The pair W1 and W2 if employed jointly can earn 100. Likewise the pair W1 and W3. Say the pair W2 and W3 if employed jointly can earn z. The three workers cannot be employed together. What is the maximum value for z such that there is a stable matching in this game ?
Samiyah and DeAndre decide to play the following game. They take turns choosing either 1, 2, or 3. As each number is chosen, it is added to the previously chosen numbers. The winner is the player who chooses a number that brings the cumulative number to 10. For example, if Samiyah chooses and DeAndre chooses 2 (so the cumulative number is 5) and Samiyah chooses 2 and DeAndre chooses 3 then DeAndre wins as his choice of 3 results in the sum equaling 10. Using SPNE, who wins?