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)
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
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
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?
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)-
Suppose there are two bidders for a single object. Each bidder has a value for the object, v1 and v2, which is randomly drawn uniformly from 0 to 80. (Note that this means the probability that a value is 25 or lower is 25/80, and more generally, the probability that a value is k or lower is k/80). Bidders see their own values but not the values of their rival bidders. Consider a first price sealed bid auction where the winner of the object is the bidder who submits the highest bid and pays the price that he bid. Suppose that you are bidder 1 and you believe that your rival always bids a constant fraction α of his value. (For example, if bidder 2’ value is 15, he will bid 15α.). 1. What is your expected winning probability of the auction from any given bid b1? (Hint, you win the auction when your bid amount b1 is greater than your opponent’s bid). 2. What is your expected payoff from any given bid, b1? (You need to write your answer as a function of v1, b1, and α). 3. Compute your best…
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…
Exercise 1.8. Consider the following "third-price" auction. There are n≥ 3 bidders. A single object is auctioned and Player / values the object $v,, with V, > 0. The bids are simultaneous and secret. The utility of Player / is: 0 if she does not win and (v-p) if she wins and pays $p. Every non-negative number is an admissible bid. Let b, denote the bid of Player i. The winner is the highest bidder. In case of ties the bidder with the lowest index among those who submitted the highest bid wins (e.g. if the highest bid is $120 and it is submitted by players 6, 12 and 15, then the winner is Player 6). The losers don't get anything and don't pay anything. The winner gets the object and pays the third highest bid, which is defined as follows. Let be the winner and fix a Player j such that b₁ = max({b,,...,b,}\ {b}) [if GAME THEORY - Giacomo Bonanno 39 max({b,...,b}\{b;}) contains more than one element, then we pick one of them]. Then the third price is defined as max({b₁,...,b}\{b,,b;}).…
Player 1 and Player 2 will play one round of the Rock-Paper-Scissors game. The winner receives a payoff +1, the loser receives a payoff -1. If it is a tie, then each player receives a payoff zero. Suppose Player 2 is using a non-optimal strategy: he/she plays Rock with probability 35%; Paper with probability 45%; and Scissors with probability 20%. Given that Player 1 knows Player 2 is using this strategy, the best response of Player 1 is to play O a mixed strategy with probability 1/3 each (Rock, Paper and Scissors) O Scissors with probability 100% O any strategy (any strategy is a best response for Player 1) O Rock with probability 100% O Paper with probability 100%
There are three bidders participating in a first-price auction for a painting. Each bidder has a private, independent value vi for such a painting that is drawn uniformly from [0,1] Assume that each bidder i has a linear bidding function bi=avi, where a>0. What is the bidding strategy of bidder i , namely bi in the Bayesian equilibrium?