N residents witness a fire in a building. Each resident can independently choose to help or not. As long as someone helps, the fire is extinguished and every resident gets a benefit of b = 5. However, any resident stopping to help pays a personal cost of c = 4, due to the possible injury. If no resident helps the fires causes damage to the building, and the payoff to all players is 0. That is, if a player decides to help, her payoff is 5-4 = 1; if she does not help and at least one of the other residents helps, her payoff is 5; and, if she does not help and neither do the other residents, her payoff is 0. Solve for the symmetric mixed strategy Nash equilibrium when N = 2. What is the probability that at least one resident stops to help? Hint: The probability that at least one player stops to help is equal to the probability that either of the players stops to help or that both players stop to help. A convenient way of computing this probability is one minus the probability that none of the players stops to help. (a) 0.06 (b) 0.16 (c) 0.2 (d) 0.36

N residents witness a fire in a building. Each resident can independently choose to help or not. As long as someone helps, the fire is extinguished and every resident gets a benefit of b = 5. However, any resident stopping to help pays a personal cost of c = 4, due to the possible injury. If no resident helps the fires causes damage to the building, and the payoff to all players is 0. That is, if a player decides to help, her payoff is 5-4 = 1; if she does not help and at least one of the other residents helps, her payoff is 5; and, if she does not help and neither do the other residents, her payoff is 0. Solve for the symmetric mixed strategy Nash equilibrium when N = 2. What is the probability that at least one resident stops to help? Hint: The probability that at least one player stops to help is equal to the probability that either of the players stops to help or that both players stop to help. A convenient way of computing this probability is one minus the probability that none of the players stops to help. (a) 0.06 (b) 0.16 (c) 0.2 (d) 0.36

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

Please try to solve it in 30 minute
Jane is interested in buying a car from a used car dealer. Her maximum willingness to pay for thecar is 12 ($12,000). Bo, the dealer, is willing to sell the car as long as he receives at least 9($9,000). What is the Nash bargaining solution to this game?
First-mover advantage is more important. Multiple Choice than in a repeated sequential game; in a one-round sequential game in a repeated game, in a sequential game in an ultimatum game; in a repeated game to those who have less to bargain with, to those who have more to bargain with What is moral hazard? Multiple Choice The tendency for people to behave in a riskier way or put forth less effort when they do not face the full consequences of their actions The tendency for people to engage in behavior that is considered highly desirable by the person who bears the cost of the behavior An agreement made between buyers and sellers who have the same information about the quality of a good or the riskaness of a situation A situation in which buyers and sellers have different information about the quality of a good or the riskiness of a situation
An old lady is looking for help crossing the street. Only one person is needed to help her; if more people help her, this is no better. You and I are the two people in the vicinity who can help; we have to choose simultaneously whether to do so. Each of us will get pleasure worth a 3 from her success (no matter who helps her), But each one who goes to help will bear a cost of 1, this being the value of our time taken up in helping. If neither player helps, the payoff for each player is zero. Set up this game in strategic form.
A total of 10 players are each choosing a number from {0,1,2,3,4,5,6,7,8}. If a player's number equals exactly half of the average of the numbers submitted by the other nine players, then she is paid $100; otherwise, she is paid 0. Solve for the strategies that survive the IDSDS.
“To be or not to be, that is the question.” Imagine that in answering this question Hamlet had the following data to consider. Hamlet must choose either “To Be” or “Not to Be.” If Hamlet chooses “To Be” then his enemy the King will make a decision to either “Kill” Hamlet or let him “Live.” If Hamlet is killed by the King his payoff in this game is 200 since he will have been killed by the King who is his uncle and who also killed Hamlet’s father, the King’s brother, who was the prior king. If the King decides to let Hamlet Live then Hamlet will be able to avenge his father’s death and his payoff will be +300. Hamlet also considers suicide an option but given the uncertainty of the afterlife if he chooses not to be then his payoff is +100 since his doesn’t what the afterlife holds for one who kills himself. Draw the complete game tree for this situation. Be sure to accurately label the tree and include the payoffs. Assume Hamlet will choose the course of action that offers the highest…
Next Friday, you plan to sell cakes at a bake sale to raise money for your school. You plan to charge $30 per cake, and you anticipate that you will sell 10 cakes. You can either purchase cakes to sell or bake them yourself. If you purchase the cakes, they will cost $25 each. If you bake your own cakes, your cost depends upon the number of cakes you bake, as shown in the table below. Number of cakes you bake Total cost of baked cakes ($) 0 0 1 10 2 22 3 36 4 52 5 70 6 90 7 112 8 136 9 162 10 190 a) How many cakes should you bake? How many cakes should you purchase? Bake ___ cake(s) and purchase ___ cake(s). b) Given your answer to part a, how much in total will the 10 cakes cost you? $ c) How much would it have cost you to bake all 10 cakes? $ d) How much would it have cost you to purchase all 10 cakes? $
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?
Problem 4: Consider an infinitely repeated game, where the base game is the following 2-person 2x2 game: A A 0,0 10, 10 S1: choose A always S2: choose B always B 10, 10 0,0 Assume both players discount the future at the same rate of r, 0 < r < 1. Limiting each player's strategies to the following six possibilities, S3: Choose A then mimic the other player's previous choice S4: Choose B, then mimic the other player's previous choice S5: Choose A, then choose the opposite of the other player's previous choice S6: Choose B, then choose the opposite of the other player's previous choice a. present the strategic form of this game, b. identify all pure-strategy Nash equilibria c. does repetition with these strategies "solve" the coordination dilemma that confronts the players in the single play of the above game.