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

When a famous painting becomes available for sale, it is often known which museum or collector will be the likely winner. Yet, the auctioneer actively woos representatives of other museums that have no chance of winning to attend anyway. Suppose a piece of art has recently become available for sale and will be auctioned off to the highest bidder, with the winner paying an amount equal to the second highest bid. Assume that most collectors know that Yakov places a value of $35,000 on the art piece and that he values this art piece more than any other collector. Suppose that if no one else shows up, Yakov simply bids $35,0002=$17,500 $35,000 2 = $17,500 and wins the piece of art. The expected price paid by Yakov, with no other bidders present, is. Suppose the owner of the artwork manages to recruit another bidder, Bob, to the auction. Bob is known to value the art piece at $28,000. The expected price paid by Yakov, given the presence of the second bidder Bob, is.
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
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.
Matthew is playing snooker (more difficult variant of pool) with his friend. He is not sure which strategy to choose for his next shot. He can try and pot a relatively difficult red ball (strategy R1), which he will pot with probability 0.4. If he pots it, he will have to play the black ball, which he will pot with probability 0.3. His second option (strategy R2) is to try and pot a relatively easy red, which he will pot with probability 0.7. If he pots it, he will have to play the blue ball, which he will pot with probability 0.6. His third option, (strategy R3) is to play safe, meaning not trying to pot any ball and give a difficult shot for his opponent to then make a foul, which will give Matthew 4 points with probability 0.5. If potted, the red balls are worth 1 point each, while the blue ball is worth 5 points, and the black ball 7 points. If he does not pot any ball, he gets 0 point. By using the EMV rule, which strategy should Matthew choose? And what is his expected…
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?
Table 9-03. Suppose you are a general in the army. Your country is at war. You are trying to invade the enemy. You can attack on the enemys east coast or the west coast. The enemy has only enough troops to defend one coast. The payoff matrix below represents whether you or the enemy wins (represented by 1) or loses (represented by 0). Enemy Defend east coast Defend west coast Enemy: 1 Enemy: 0 Attack east coast You: 0 You: 1 You Enemy: 0 Enemy: 1 Attack west coast You: 1 You: 0 Refer to Table 9-03. To win the war, O a. you must attack the west coast, only if you have credible information that the enemy is defending the east coast. O b. you must attack the west coast, and information about whether the enemy is defending the east or the west coast is irrelevant to you. c. you must attack the west coast, only if you have credible information that the enemy is defending the west coast. d. you must never attack the west coast, and information about whether the enemy is defending the east or…
When a famous painting becomes available for sale, it is often known which museum or collector will be the likely winner. Yet, the auctioneer actively woos representatives of other museums that have no chance of winning to attend anyway. Suppose a piece of art has recently become available for sale and will be auctioned off to the highest bidder, with the winner paying an amount equal to the second highest bid. Assume that most collectors know that Valerie places a value of $15,000 on the art piece and that she values this art piece more than any other collector. Suppose that if no one else shows up, Valerie simply bids $15,000/2=$7,500 and wins the piece of art. The expected price paid by Valerie, with no other bidders present, is $________.. Suppose the owner of the artwork manages to recruit another bidder, Antonio, to the auction. Antonio is known to value the art piece at $12,000. The expected price paid by Valerie, given the presence of the second bidder Antonio, is $_______. .
Apple and Google are interested in hiring a new CEO. Both firms have the same set of final candidates for the CEO position: Indra, Cao, and Virginia. Both firms need to decide who to make a job offer to, and the hiring process is such that they each only make one job offer. If, say, Apple makes a job offer to Indra and Google makes a job offer to one of the other candidates, then Apple’s probability of success in hiring Indra is pIndra. The same is true for Google. If they both make a job offer to Indra, each has probability pIndra/2 of success. It has been estimated that pIndra = 20%, and pCao = pVirginia = 30% (Note that these probabilities need not add up to 100%). Suppose that both Apple and Google attach a valuation of 10 to successfully hiring Indra, and a valuation of 7 to successfully hiring each of the other candidates. A hiring attempt, if unsuccessful, has a valuation of zero. Convert this story into a game by completing the following game table; Google…
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.
See the extensive form game in the image attached (the payoffs of player 1 are written on top and the payoffs of player 2 are on the bottom). a) Write this game in normal form (a player's strategy is a complete contingent plan that tells them what to play at each of their information sets) (b) Find all the Nash equilibria of the normal form game from part (a)
Microsoft and a smaller rival often have to select from one of two competing technologies, A and B. The rival always prefers to select the same technology as Microsoft (because compatibility is important), while Microsoft always wants to select a different technology from its rival. If the two companies select different technologies, Microsoft's payoff is 6 units of utility, while the small rival suffers a loss of utility of 2. If the two companies select the same technology, Microsoft suffers a loss of utility of 2 while the rival gains 2 units of utility. Using the given information, fill in the payoffs for each cell in the matrix, assuming that each company chooses its technology simultaneously. Microsoft Technology A Technology B Rival Technology A Rival: , Microsoft Rival: , Microsoft Technology B Rival: , Microsoft Rival: , Microsoft True or False: There is no equilibrium in pure strategies. True False Note:- Do not provide handwritten…
3. Two individuals are involved in a synergistic relationship. If both individuals devote more effort to the relationship, they are both better off. Specifically, an effort level is a nonnegative number, and player 1's payoff function is e₁(1+€₂-e₁), where ei is player i's effort level. For player 2 the cost of effort is either the same as that of player 1, and hence her payoff function is given by e2(1+e₁ - e₂), or effort is very costly for her in which case her payoff function is given by e₂(1 + e₁ — 2e2). 1 Player 2 knows player 1's payoff function and whether the cost of effort is high for herself or not. Player 1, however, is uncertain about player 2's cost of effort. He believes that the cost of effort is low with probability p, and high with probability 1 - p, where 0 < p < 1. Find the Bayesian Nash equilibrium of this game as a function of p.