Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7

Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7

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

Consider the following game, called matching pennies, which you are playing with a friend. Each of you has a penny hidden in your hand, facing either heads up or tails up (you know which way the one in your hand is facing). On the count of “three,” you simultaneously show your pennies to each other. If the face-up side of your coin matches the face-up side of your friend’s coin, you get to keep the two pennies. If the faces do not match, your friend gets to keep the pennies. a. Construct a payoff matrix for the game. Instructions: Note that if you get to keep the two pennies, this is a gain of one penny for you and a loss of one penny for your friend. So, your payoff would 1 and your friend's would be −1. Similarly, if your friend gets to keep the two pennies, then your payoff would −1 and your friend's would be 1. When entering the payoffs in the table below, use whole penny numbers (no decimals), and if you are entering any negative numbers be sure to include a negative sign (−)…
a. b. Each firm has four alternative strategies, and a certain profit/payoff is associated with each strategy. The numbers in the payoff matrix denote firm A's profit (in thousands of dollars). The total amount of profit that can be earned by the two firms together is $20000. (This is called a "constant sum game.") Firm B's profit is therefore $20000 minus firm A's profit. What strategies will the two firms select? Is the game strictly determined? If so, how much does each firm gain? B's strategies A's strategies ↓ Increase Advertising Decrease Price Increase Price Alter Product Increase Advertising 0 11 8 11 Decrease Price 8 10 6 2 Increase Price 7 12 15 Alter Product 4 15 3 12 Suppose now that due to a change in consumer preferences, firm A's "Increase Price" strategy pays off better than before when firm B elects to "Decrease Price," that is, the payoff rises from 6 to 14. What strategies will the two firms now select? Is the game strictly determined? If so, how much does each firm…
Player 1 can stay at home or fly to New York, in which case Player 2 can meet Player 1, who can then buy a drink for Player 2. See the game below. Which of the following completely describes a possible strategy for Player 1? 1 Fly to New York Stay home Stay home Stay home and Don't buy drink Fly to New York and Meet Stay home or Fly to New York 2 Meet Don't meet 0,0 1 Buy drink Don't buy drink -2,0 1,2 -1, -1
Two discount stores (Megastore and Superstore) are interested in expanding their market share through advertising. The table below depicts the strategic outcomes (profits) of both stores with and without advertising. Superstore - Advertise Superstore - Don't Advertise Megastore - Advertise $95, $80 $305, $55 Megastore - Don't Advertise $65, $285 $165, $115 When the game does reach Nash Equilibrium, the payoffs for both stores will be a) Megastore $95 and Superstore $80 b) Megastore $305 and Superstore $55 c) Megastore $65 and Superstore $285 d) Megastore $165 and Superstore $115
Once again, two ice cream truck vendors, A and B, are playing a simultaneous pricing game. If only one of the vendors prices low, he gets all the customers for a payoff of 12, while the other vendor gets no customers and a payoff of zero. If both vendors price high, they each get a payoff of 6. If both price low, they each get a payoff of 5. Suppose that the above game is repeated indefinitely, and together the vendors adopt a trigger strategy such that they would start charging the low price only if the other vendor charged a low price last time. Provided that the vendors stick to their new strategy, what would be the Nash equilibrium going forward? a) Both the vendors price high b) Both the vendors price low c) Vendor A prices high, vendor B prices low d) Vendor B prices high, vendor A prices low
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…
Part 1 Sam and Ray do not like each other and will be miserable if they attend the same event. Both are going out Friday night to either the bar or a concert; and Sam will publicly tweet where he is going before Ray makes his plans. Each will get 6 payoff from going to a concert and 2 benefit from going to the bar if the other is not there. If both go to the same venue, they will get a payoff of zero. Write a game tree for this game and find the equilibrium strategy and equilibrium payoffs clearly labeling both. Part 2 Take the game from the question above and switch the order of the decisions. Write a game tree for this game and find the equilibrium strategy and equilibrium payoffs clearly labeling both. Has the equilibrium strategies and payoffs changed from the question above? Explain why.
Please help with #2
A and B are a couple and they want to go into a concert. A comes from Bonn and loves the music of Ludwig van Beethoven. B comes from Salzburg and loves the music of Wolfgang Amadeus Mozart. There are two concerts in town: one with the music of Beethoven and one with the music of Mozart. Both (A and B) prefer to go to a concert together. If both go to a concert of Beethoven, A has a pay-off of 4 and B has a pay-off of 2. If both go to a concert of Mozart, B has a pay-off of 4 and A has a pay-off of 2. If A goes to a concert of Mozart and B to a concert of Beethoven, they are both miserable and get a pay-off of 0. But, if B goes to a concert of Mozart and A to a concert of Beethoven, they are both a little better off with a pay-off of 1. Both A and B have to make a simultaneous decision and cannot communicate prior to the decision. (a) Construct the pay-off matrix for this game. (b) Identify the Nash equilibrium or equilibria of the game. (c) Which off the allocations are…
Consider the following static, single-shot game played between two cyclists, Chico and Loco, who find themselves riding towards each other down a narrow lane. Chico wants to pass by safely, and he can only do this by cycling on the opposite side of the lane to Loco. So, he has two options: to cycle on the Right of the lane, or to cycle on the Left. Loco meanwhile is having a bad day and wants to crash into Chico, and the way he can achieve this is by cycling on the same side of the lane as Chico. So again, he has two options: to cycle on the Right of the lane, or to cycle on the Left. He does not care at all about hurting himself if they collide. (c) By constructing the best response lines of both players, identify all Nash equilibrium outcomes in the above game i.e., in pure and mixed strategies. (d) Provide an intuitive interpretation of the equilibrium outcome(s) identified in part (c) above.
Consider the 2-player, zero-sum game "Rock, Paper, Scissors". Each player chooses one of 3 strategies: rock, paper, or scissors. Then, both players reveal their choices. The outcome is determined as follows. If both players choose the same strategy, neither player wins or loses anything. Otherwise: • "paper covers rock": if one player chooses paper and the other chooses rock, the player who chose paper wins and is paid 1 by the other player. "scissors cut paper": if one player chooses scissors and the other chooses paper, the player who chose scissors wins and is paid 1 by the other player. "rock breaks scissors": if one player chooses rock and the other player chooses scissors, the player who chose rock wins and is paid 1 by the other player. We can write the payoff matrix for this game as follows: rock paper scissors rock 0 -1 1 paper 1 0 scissors -1 1 -1 0 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper…
Player A and B each announce a color (red, white, blue, or green) simultaneously. The winner is determined by the following rules: red beats white, white beats blue, blue beats green, and green beats red. If both players announce the same color the game is a draw. The payoffs work as follows, if player A wins with red, she wins 5, if player A wins with white or blue, she wins 2, and if player A wins with green, she wins 3. If player B wins with red or white, he wins 4, if player B wins with blue he wins 3, and if player B wins with green he wins 5. The above description leaves out the cases where players announce colors that are not directly comparable. For example, there is no rule for what happens if one player announces white and the other announces green. In these situations, the winner is determined by examining the number of letters in each color that is announced. If both colors have the same number of letters, then the game is a draw. If there are a different number of letters…