Two people are involved in a dispute. Person 1 does not know whether person 2 is strong or weak; she assigns probability a to person 2's being strong. Person 2 is fully informed. Each person can either fight or yield. Each person's preferences are represented by the expected value of a Bernoulli payoff function that assigns the payoff of 0 if she yields (regardless of the other person's action) and a payoff of 1 if she fights and her opponent yields; if both people fight then their payoffs are (-1, 1) if person 2 is strong and (1, -1) if person 2 is weak. Formulate this situation as a Bayesian game and find its Nash equilibria if a < 1/2 and if a > 1/2. "

Two people are involved in a dispute. Person 1 does not know whether person 2 is strong or weak; she assigns probability a to person 2's being strong. Person 2 is fully informed. Each person can either fight or yield. Each person's preferences are represented by the expected value of a Bernoulli payoff function that assigns the payoff of 0 if she yields (regardless of the other person's action) and a payoff of 1 if she fights and her opponent yields; if both people fight then their payoffs are (-1, 1) if person 2 is strong and (1, -1) if person 2 is weak. Formulate this situation as a Bayesian game and find its Nash equilibria if a < 1/2 and if a > 1/2. "

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

How do you solve this problem? (see attachment)
Two employees witness fraud committed in their firm. Each has two pure strategies: to become a whistleblower and report a crime, or not to report a crime. Each employee gets a payoff of 1 if the crime is reported by someone (it does not matter if both or only one employee reports). However, reporting the crime is costly. An employee who reports has to pay the cost of reporting equal to 0.5-0.25*d, where d=1 if the other employee also reports, and d=0 otherwise. Suppose that employees simultaneously decide to report or not. There is a unique mixed strategy Nash equilibrium in this game where each employee reports with the same positive probability less than 1. What is the probability that the crime is reported by at least one employee in such an equilibrium? ________
In Homework 1, we saw that there is no strict dominant strategy equilibrium in an inspection game. Thus, the players must randomize and play a mixed strategy in equilibrium. Suppose the agent shirks with probability p₁ and works with probability (1 - p₁), while the principal inspects with probability p2 and does not inspect with probability (1-P2). Find the mixed strategy equilibrium for this game. I NI S (0, -k) (w, -w) W (w c, p-w-k)| (wc, p-w) Table 1: Payoff matrix for the inspection game
Two players, both with zero wealth, bargain over how to divide £X > 0 between them. Failure to reach agreement means both get nothing. Both players are expected utility max- imisers. Player 1 has utility u(x) = x", where 0 < a < 1. Player 2 has utility u(x) = xº, where 0 < ß < 1. Determine the Nash solution for this problem
None
Two neighborhood kids can play at home or walk to a nearby park. Playing with their toys yields some happiness. However, they would enjoy playing with the other kid at the park even more at the park. But each has a concern that if they go the park the other will not show up. This is an interesting game or situation because neither kid has an incentive to betray the other and not show up, but each kid fears walking to the park and having no one to play with. They also have to fear that if the other kid thinks they won't show up, that other kid will won't show up. All this strategic thinking is a lot for kids to take in. Here is the payoff matrix: Kid 1 Toys at Home Park Toys at Home Kid 2 Park How many Nash equilbria are there? 1,2,3 or 4 There is an option to let Kid 1 move first, but no option for Kid 2 to move first. Should Kid 2 let Kid 1 move first. Yes or No Blank # 1 Blank # 2
L R 1,2,3 3,1,1 D 3,1,0 2,5,2 L T 0,2,0 4,1,4 4,1,1 0,5,2 Consider both pure and mixed strategies, if probability p assigns to T of player 1. q assigns to L of player 2. r assigns to L of player 3. Does this have a nash equilibrium if r =1 or 0?
Two workers independently choose how much effort to put in their jobs. If worker 1 chooses e₁ ≥ 0 and worker 2 chooses e2 ≥ 0, their payoffs are given by u₁(e₁,e2,01,02) = 0₁e₁ + ße₁e₂ · - 1/² u₁ (e₁,e₂,0₁,0₂) = 0₂ €₂ + ßе₁e₂. = ²2 where 0 <ß < 1 and 0 ≤ 0; ≤ 1 for i: = 1,2. Assume that 0; is player i's private information: each player knows her own 0 and believes that the other player's 0 is drawn from the uniform distribution over [0, 1]. Find the Bayesian Nash equilibria of this game.
Boris and Angela are negotiating a new trade deal, which resembles a modified centipede game. When it is their turn, each of them decides whether to cooperate (C) or to decline (D). Unfortunately, Angela is not sure how much time Boris has for the negotiations before he needs to leave to talk to Emmanuel. With probability p = 4/5, Boris will stay and insist on making the final proposal (long game, L). With probability 1 − p = 1/5, Boris will have to rush off, so that the game ends after Angela’s move (short game, S). Boris has perfect knowledge of his schedule. The structure and payoffs are represented in the game tree below (Attached picture). (a) Specify the set of possible histories H of the game. Underline terminal histories.(b) Specify the set of possible strategies for Boris and Angela.(c) How many subgames does this game have? Indicate all subgames in this game
Consider two companies bidding to be at the top of a search engine's results for a given keyword. Company 1 values the top position at v₁ = 8. Both company 1 and company 2 know company 1's value. However, only company 2 knows its own valuation for the top position, which can take two values: v₂ = 6 or v₂ = 10. Company 1 believes that company 2 has a valuation of v2 = 6 with probability and a valuation of v2 = 10 with probability. Each company chooses simultaneously whether to submit a bid of b = 6 or a bid of b = 8. The company which submitted the highest bid wins the auction and obtains the top position in the search engine. If both firms submit the same bid, then firm 1 wins the auction. A company's payoff is therefore: V₁₂ = -{- Vi - bi if it wins the auction if it loses the auction 1) What are the possible types of company 2?
A buyer and seller trade with each other for an infinite number of periods. Both parties have a discount factor of d, where 0 < d < 1. In each period both parties can play trust (T) or to play selfish (S). If both the buyer and seller play T the payoffs are 4 to each player. If both parties plays the payoffs are 3 to each player. If one player plays S and the other T, the payoffs are 6 to the player who opted for 5 and 1 to the party that opted for T. Consider the following trigger strategy. In the first period play T. In any subsequent period, play T if in every previous period the outcome was (T, T), if not play S. What is the minimum d required for this trigger strategy to be subgame perfect equilibrium? O None of the other answers are correct. O 1/4 O 1/3 O 3/4
Here is a Bayesian BOS game. Man has a special preference t1 on boxing while woman has a special preference t2 on opera. Both are in [0,2]. The preference information is private. i.e. Each knows his (her) own preference but does not know the other's preference. The below is the payoff. M/W Boxing Opera Воxing 3+t1,1 0,0 Opera 0,0 1,3+t2 We are checking whether the below strategy profile is a Bayesian Nash Equilibrium. "Man chooses boxing if t1>p while woman chooses opera if t2>g." 1) Given t1, man will choose boxing if t1> /g- 2) Given t2, woman will choose opera if t2> /p- 4) By shoving the simultaneous equations, we get p=q=sqrt(6)-