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?

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
a) Find the Nash equilibria in the game (in pure and mixed strategies) and the associated payoffs for the players. b) Now assume that the game is extended in the following way: in the beginning Player 1 can decide whether to opt out (this choice is denoted by O) or whether to play the simultaneous-move game in a) (this choice is denoted by G). If Player 1 opts out (plays O) then both Player 1 and Player 2 get a payoff of 4 each and the game ends. If Player 1 decides to play G, then the simultaneous-move game is played. Find the pure-strategy Nash equilibria in this extended version of the game. (Hint: note that Player 1 now has 4 strategies and write the game up in a 4x2 matrix.) c) Write the game in (b) up in extensive form (a game tree). Identify the subgames of this game.
answer the ff: Suppose that each company cancharge either a high price for tickets or a low price. Ifone company charges $300, it earns low profit if theother company also charges $300 and high profit ifthe other company charges $600. On the other hand,if the company charges $600, it earns very low profit ifthe other company charges $300 and medium profitif the other company also charges $600.a. Draw the decision box for this game.b. What is the Nash equilibrium in this game?Explain.c. Is there an outcome that would be better than theNash equilibrium for both airlines? How could itbe achieved? Who would lose if it were achieved?
The mixed stratergy nash equalibrium consists of : the probability of firm A selecting October is 0.692 and probability of firm A selecting December is 0.309. The probability of firm B selecting October is 0.5 and probability of firm selecting December is 0.5. In the equilibrium you calculated above, what is the probability that both consoles are released in October? In December? What are the expected payoffs of firm A and of firm B in equilibrium?
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
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 variation to the Rock (R), Paper (P), Scissors (S) game:• Suppose that the Player 1 (row player) has a single type, Normal.• Player 2 (column player) has two types Normal and Simple.• A player of Normal type plays this zero-sum game as we studied in class whereas a player of type Simple always play P.• Player 2 knows whether he is Normal or Simple, but player 1does not.a) Suppose player 2 is of type Normal with probability 1/3 and of type Simple with probability (2/3). Find all pure strategy Bayesian Nash Equilibria.b) Suppose player 2 is of type Normal with probability 2/3 and of type Simple with probability (1/3). Find all pure strategy Bayesian Nash Equilibria.
You and a rival are engaged in a game in which there are three possible outcomes: you win, your rival wins (you lose), or the two of you tie. You get a payoff of 50 if you win, a payoff of 20 if you tie, and a payoff of 0 if you lose. What is your expected payoff in each of the following situations? (a) There is a 50% chance that the game ends in a tie, but only a 10% chance that you win. (There is thus a 40% chance that you lose.) (b) There is a 50–50 chance that you win or lose. There are no ties. (c) There is an 80% chance that you lose, a 10% chance that you win, and a 10% chance that you tie.
Each of the two players independently (and simultaneously with the other) decides whether to go to a play or a concert. Each would rather go with the other to a concert than with them to a play, but prefers this to not being together, in which case they don't care where they go alone. Additionally, each is indifferent between attending the play together and participating in a lottery where both go to the concert with a probability of ¾ and to different events with a probability of ¼. Describe the game in matrix form and find all its equilibria under the assumption that the players have von Neumann-Morgenstern preferences.
Consider Bernard \ Mary Left Center Right Top 0,5 1,0 2,2 Bottom 1,0 0,3 2,2 The first number in a cell denotes the payoff to Bernard and the second number denotes the payoff to MaryForexample: πB(B,L)=1and πM(T,L)=5. a Give all pure strategy Nash equilibria of this one-shot game, if any. Briefly explain.Let Bernard play Top with probability p and Bottom with probability 1 − p; let Mary play Left with probability qL , Center with probability qC and Right with probability qR = 1 − qL − qC . b Give all mixed strategy Nash equilibria of this game.
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?
We’ll now show how a college degree can get you a better job even if itdoesn’t make you a better worker. Consider a two-player game between aprospective employee, whom we’ll refer to as the applicant, and an employer. The applicant’s type is her intellect, which may be low, moderate,or high, with probability 1/3 , 1/2 , and 1/6 , respectively. After the applicantlearns her type, she decides whether or not to go to college. The personalcost in gaining a college degree is higher when the applicant is less intelligent, because a less smart student has to work harder if she is to graduate. Assume that the cost of gaining a college degree is 2, 4, and 6 for an applicant who is of high, moderate, and low intelligence, respectively.The employer decides whether to offer the applicant a job as a manageror as a clerk. The applicant’s payoff to being hired as a manager is 15,while the payoff to being a clerk is 10. These payoffs are independent ofthe applicant’s type. The employer’s payoff from…