1. You have probably had the experience of trying to avoid encountering someone, whom we will call Rocky. In this instance, Rocky is trying to find you. It is Saturday night and you are choosing which of two possible parties to attend. You like Party 1 better and, if Rocky goes to the other party, you get a payoff 20 at Party 1. If Rocky attends Party 1, however, you are going to be uncomfortable and get a payoff of 5. Similarly, Party 2 gives you a payoff of 15, unless Rocky attends, in which case the payoff is 0. Rocky likes Party 2 better, but he is likes you. He values Party 2 at 10, Party 1 at 5, and your presence at either party that he attends is worth an additional payoff of 10. You and Rocky both know each others strategy space (which party to attend) and payoffs functions.

1. You have probably had the experience of trying to avoid encountering someone, whom we will call Rocky. In this instance, Rocky is trying to find you. It is Saturday night and you are choosing which of two possible parties to attend. You like Party 1 better and, if Rocky goes to the other party, you get a payoff 20 at Party 1. If Rocky attends Party 1, however, you are going to be uncomfortable and get a payoff of 5. Similarly, Party 2 gives you a payoff of 15, unless Rocky attends, in which case the payoff is 0. Rocky likes Party 2 better, but he is likes you. He values Party 2 at 10, Party 1 at 5, and your presence at either party that he attends is worth an additional payoff of 10. You and Rocky both know each others strategy space (which party to attend) and payoffs functions.

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

RUSH. Answer for a, b, and c.
help please. please be detailed please. i think we also need to draw some diagrams
2
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
Terry's payoff is the first number in each cell and a higher number is a better outcome. Assume that Terry and Kerry make their decisions simultaneously. Kerry Clean Don't clean Terry Clean ( 8, 2) ( 3, 5 ) Don't ( 10, 3) ( 4, 1 ) clean The Nash equilibrium of this game is Terry will [Select ] v and Kerry will [ [ Select ]
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
Let us see the example of Juan and María given but modify their preferences. It is still the case that they are competitive and are deciding whether to show up at their mom’s house at 8:00 A.M., 9:00 A.M., 10:00 A.M., or 11:00 A.M. But now they don’t mind waking up early. Assume that the payoff is 1 if he or she shows up before the other sibling, it is 0 if he or she shows up after the other sibling, and it is 1 if they show up at the same time. The time of the morning does not matter. Find all Nash equilibria.
Q2 Consider a game between 2 payers (Ann and Bill) where each chooses between 3 actions (Up, Middle and Down). 1) Create a payoff matrix that reflects this. 2) Fill in payoff numbers that makes this game a Prisoner's Dilemma. 3) Explain why your game is a Prisoner's Dilemma.
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 3 units of utility, while the small rival suffers a loss of utility of 1. If the two companies select the same technology, Microsoft suffers a loss of utility of 1 while the rival gains 1 units of utility.
6. Eventually, Aron and Nora who we met in the previous problem were able to get together and have now been an item for some time. So long, in fact, that there are issues. Aron is a little insecure, which makes him jealous. Nora is none too pleased about it. When she arranges a girls' night out with some of her friends, Aron is very upset and threatens to break up. So Nora has to decide to go out with her friends or stay home with Aron. If she stays home, she gets a payoff of 0, whereas Aron gets what he wants and a payoff of 2 (perhaps he should be a little more concerned with Nora's happiness). On the other hand, if Nora decides to go out, then Aron must make a choice between breaking up or not. If he breaks up, both he and Nora are miserable and each receives a payoff of -1. If he does not, he gets a payoff of 1 while Nora gets what she wants and a payoff of 2. a) Draw the extensive form of this game. b) Find all Nash equilibria. Explain your answer carefully. c) Find the backward…
38. Consider the following game. There are ten churches in town: nine are Catholic and one is Eastern Orthodox. All churches conduct their divine services at 10am on Sunday morning. You and your friend, without communication, agree to meet at a church service. If you fail to meet at the same church, then you are sad and become a Doomer. What is this game's focal point? Remember that you cannot communicate about this. (A) You meet at any of the Catholic churches. (B) You meet at any of the churches – denomination does not matter. We're all the same bro. (C) You meet at the Orthodox church. (D) There is no focal point. 39. Consider a fractional-reserve banking system in which an initial deposit of $1,000 can generate up to $4,000 in money. What is the reserve ratio? (A) 4 percent. (B) 5 percent. (C) 25 percent. (D) 75 percent.
Two friends are deciding where to go for dinner. There are three choices, which we label A, B, and C. Max prefers A to B to C. Sally prefers B to A to C. To decide which restaurant to go to, the friends adopt the following procedure: First, Max eliminates one of three choices. Then, Sally decides among the two remaining choices. Thus, Max has three strategies (eliminate A, eliminate B, and eliminate C). For each of those strategies, Sally has two choices (choose among the two remaining). a.Write down the extensive form (game tree) to represent this game. b.If Max acts non-strategically, and makes a decision in the first period to eliminate his least desirable choice, what will the final decision be? c.What is the subgame-perfect equilibrium of the above game? d. Does your answer in b. differ from your answer in c.? Explain why or why not. Only typed Answer