Games 3. Consider the following game. Bob LR Ann U (2.0) (1.6) D19) (31) a. Find all Nash equilibria for the game, including mixed or randomized equi libria if there are any. b. Suppose that Ann always plays D and Bob plays L in the odd periods and R in the even periods. In the long run, this gives the players average payoffs (2,5). Compute the discount factor required for the Ann and Bob to coop- erate and play the strategy just described. Outline the trigger strategies you are considering for them.

Games 3. Consider the following game. Bob LR Ann U (2.0) (1.6) D19) (31) a. Find all Nash equilibria for the game, including mixed or randomized equi libria if there are any. b. Suppose that Ann always plays D and Bob plays L in the odd periods and R in the even periods. In the long run, this gives the players average payoffs (2,5). Compute the discount factor required for the Ann and Bob to coop- erate and play the strategy just described. Outline the trigger strategies you are considering for them.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.6P

See similar textbooks

Similar questions

on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
10 1. Consider the game where initially She chooses between "Stay Home" and "Go Out". If She chooses "Stay Home" then She gets 2 and He gets 0. If She chooses "Go Out" then they each simultaneously choose "Movie" or "Concert" where the payoffs are 0,1 or 3 as in the Battle of the Sexes Game. What are the subgame perfect Nash Equilibria of this game ?
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
Game Theory Consider the entry game with incomplete information studied in class. An incumbent politician's cost of campaigning can be high or low and the entrant does not know this cost (but the incumbent does). In class, we found two pure-strategy Bayesian Nash Equilibria in this game. Assume that the probability that the cost of campaigning is high is a parameter p, 0 < p < 1. Show that when p is large enough, there is only one pure-strategy Bayesian Nash Equilibrium. What is it? What is the intuition? How large does p have to be? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
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 What is the highest payoff any player can receive in any subgame perfect Nashequilibrium of the repeated game?
E3 Bayesian Game]. Consider a Bayesian game described by a following payoff matrix. Please solve (show your solution). 1. Enumerate all pure strategies for each player. 2. Suppose that player 1 observes his type ?1 = 3. How does player 1 think of the probability of ?2? 3. Find a (pure strategy) Bayesian Nash equilibrium.
Consider the game with the payoffs below. Which of the possible outcomes are MORE efficient than the Nash Equilibrium (NE)? Note, they do NOT need to be Nash equilibria themselves, they just need to be more efficient than the NE. Multiple answers are possible, but not necessary. You need to check ALL correct answers for full credit. JILL High Medium LowMAGGIE Left 3,4 2,3 2,2Center 4,8 9,7 8,7Right 7,6 8,5 9,4Group of answer choices (Left, Low) There is no strategy combination that is more efficient than the Nash equilibrium for this game. (Right, Medium) (Left, High) (Center, Medium) (Center, High) (Center, Low) (Left, Medium) (Right, Low) (Right, High)
Suppose two players play a two-period repeated game, where the stage game is the normal-form game shown below. Is there a subgame perfect Nash equilibrium in which the players select (A, X) in the first period? If so, fully describe such equilibrium. If not, explain why not. Player 1 has choice A, B; Player 2 has choice X, Y, Z. Payoff: (A,X)-(5,7), (A,Y)-(2,4), (A,Z)-(3,8), (B,X)-(1,4), (B,Y)-(3,5), (B,Z)-(1,4)
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?