Consider the following Bayesian game. There are two players 1 and 2. Both players choose whether to play A or B. Two states are possible, L and R. In the former, players play a stag-hunt game, and in the latter, players play a matching pennies game. Suppose that Player 2 knows the state, while Player 1 thinks that the state is L with probability q and R with probability 1 ! q. Payo§s in each state respectively satisfy: Player 1 is the row player, and their payo§ is the first to appear in each entry. Player 2 is the column player and their payo§ is the second to appear in each entry. (a) What is the set of possible strategies for the two players in this game? (b) Find all the pure strategy Bayes Nash equilibria for any value of q 2 (0, 1).

Consider the following Bayesian game. There are two players 1 and 2. Both players choose whether to play A or B. Two states are possible, L and R. In the former, players play a stag-hunt game, and in the latter, players play a matching pennies game. Suppose that Player 2 knows the state, while Player 1 thinks that the state is L with probability q and R with probability 1 ! q. Payo§s in each state respectively satisfy: Player 1 is the row player, and their payo§ is the first to appear in each entry. Player 2 is the column player and their payo§ is the second to appear in each entry. (a) What is the set of possible strategies for the two players in this game? (b) Find all the pure strategy Bayes Nash equilibria for any value of q 2 (0, 1).

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

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
2. Consider the following Bayesian game with two players. Both players move simultaneously and player 1 can choose either H or L, while player 2's options are G, M, and D. With probability 1/2 the payoffs are given by "Game 1" : GMD H 1,2 1,0 1,3 L 2,4 0,0 0,5 and with probability 1/2 the payoffs are according to "Game 2" : G |M|D H 1,2 1,3 1,0 L 2,4 0,5 0,0 (a) Find the Nash Equilibria when neither player knows which game is actually played. (b) Assume now that player 2 knows which one among the two games is actually being played. Check that the game has a unique Bayesian Nash Equilibrium.
David wants to auction a painting, and there are two potential buyers. The value for eachbuyer is either 0 or 10, each value equally likely. Suppose he offers to sell the object for $6, and the two buyers simultaneously accept or reject. If exactly one buyer accepts, the object sold to that person for $6. If both accept, the object is allocated randomly to the buyers, also for $6. If neither accepts, the object is allocated randomly to the bidders for $0. (a) Identify the type space and strategy space for each buyer. (b) Show that there is an equilibrium in which buyers with value 10 always accept. (c) Show that there is an equilibrium in which buyers with value 10 always reject.
Professor can give a TA scholarship for a maximum of 2 years. At the beginning of each year professor Hahn decides whether he will give a scholarship to Gong Yi or not. Gong Yi can get a scholarship in t=2, only if he gets it in t=1. Basically, the professor and TA will play the following game twice. TA can be a Hardworking type with probably 0.3 and can be a Lazy type with a probability of 0.7. Professor does not know TA's type. If TA is hard working, it will be X=5 and TA will always work if he gets a scholarship. If TA is lazy, it will be X= 1. There is no time discount for t=2. Find out a Perfect Bayesian Equilibrium of the game.
Consider the game Ms. Bennet and Mr. Darcy play in ‘First Impressions’, Selected Set V. Suppose that Ms. Bennet prefers to meet Mr. Darcy (a = 0) with probability p. Further suppose that: - The ‘meeting Ms. Bennet’ plays Ball with probability q (and Dinner with probability 1 − q); - ‘avoiding Ms. Bennet’ plays Ball with probability r (and Dinner with probability 1 − r); M - r. Darcy plays Ball with probability s (and Dinner with probability 1 − s). Write down the strategic form game and find for all values of p ∈ (0, 1) the Bayesian-Nash equilibria in mixed strategies.
1.a) If the three executives of a fraudulent organization report nothing to the authorities, each gets a payoff of 100. If at least one of them blows the whistle, then those who reported the fraud get 28, while those who didn’t get -100. Suppose they play a symmetric mixed-strategy Nash equilibrium where each is silent (does not report fraud) with probability p. What is p?A, 0.1B, 0.28C, 0.5D, 0.8 b) In a two-player game, with strategies and (some known and some unknown) payoffs as shown below, suppose a mixed-strategy equilibrium exists where 1 plays C with probability 3/4, and Player 2 randomizes over X, Y, and Z with equal probabilities. What are the pure-strategy equilibria of this game? A, (A, Y) and (B, X)B, (A, Z) and (C, Y)C, (B, X) and (C, X)D, (C, X) and (C, Y)
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.
The deciding shot in a soccer game comes down to a penalty shot. If the goal-keeper jumps in one corner and the player shots the ball in the other, then it is a goal. If the goalie jumps left and the player shoots left, then it is a goal with probability 1/3. If the goalie jumps right and the player shots right, it is goal with probability 2/3. If both players play Nash strategies, what is the expected value of goals that will follow from this penalty shot. 1/9 2/9 3/9 4/9 5/9 6/9 O7/9
For the following simultaneous move game, we want to find a mixed strategy Nash equilibrium. ROWENA Safe 4*q + 4*(1-q) = Risky Safe 1 4,4 1,4 COLIN Risky 4,1 We denote Colin's mixture probability on Safe by q.. To find q in Colin's mixed strategy Nash equilibrium, we apply indifference property to player Rowena 's expected payoffs from pure strategies in mixture: 6,6 +q+6 *(1-q)
Consider the following two-player game.First, player 1 selects a number x≥0. Player 2 observes x. Then, simultaneously andindependently, player 1 selects a number y1 and player 2 selects a number y2, at which pointthe game ends.Player 1’s payoff is: u1(x; y1) = −3y21 + 6y1y2 −13x2 + 8xPlayer 2’s payoff is: u2(y2) = 6y1y2 −6y22 + 12xy2Draw the game tree of this game and identify its Subgame Perfect Nash Equilibrium.
With what probability does player 1 play Down in the mixed strategy Nash equilibrium? (Input your answer as a decimal to the nearest hundredth, for example: 0.14, 0.56, or 0.87). PLAYER 1 Up Down PLAYER 2 Left 97,95 47, 33 Right 8,43 68,91
This payoff matrix shows a two-player variant of the sushi game, but where B really loves sushi, so her payoffs from getting to eat sushi are higher than A's, and her payoffs from there not being enough sushi are lower than A's. Payoffs are ordered A, B. В A 10, 15 10, 25 20, 15 0, -5 A. Find and state all of the mixed strategy Nash equilibria of the game. If there are multiple equilibria, number them in preparation for answering part "c." B. (From the week 6 lectures) Draw a graph of the expected payoffs for each player. Use these graphs to formulate the decision rule for each player. C. (From the week 6 lectures) Draw a graph of the best replies of the two players. Carefully label each Nash equilibrium.