Consider the following game. You will roll a fair, 6-sided die either once or twice. You decide whether to do the second roll after you see how the first one lands. The payoff is $n, where n is the outcome of the last roll. For example, if the first roll lands 4 and the second lands 2, you win $2. If you only do one roll and it lands 4, you win $4. Suppose you make your decision about whether to go for a second roll based on expected monetary value. Then you will go for a second roll if (and only if) the first roll lands x or lower. What is x?

Consider the following game. You will roll a fair, 6-sided die either once or twice. You decide whether to do the second roll after you see how the first one lands. The payoff is $n, where n is the outcome of the last roll. For example, if the first roll lands 4 and the second lands 2, you win $2. If you only do one roll and it lands 4, you win $4. Suppose you make your decision about whether to go for a second roll based on expected monetary value. Then you will go for a second roll if (and only if) the first roll lands x or lower. What is x?

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 played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
Consider a variation of the television station broadcast game of Exercise 4 in Chapter 7. Suppose the stations interact sequentially. First, MBC chooses between 6:00 and 7:00. Then, after observing MBC’s choice, RBC decides between 6:00 and 7:00. Finally, after observing the behavior of both MBC and RBC, CBC chooses either 6:00 or 7:00. Payoffs are as given before. Draw the extensive form of this sequential game and compute the subgame perfect equilibrium.
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.
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…
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?
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.
John and Paul are walking in the woods one day when suddenly an angry bear emerges from the underbrush. They each can do one of two things: run away or stand and fight. If one of them runs away and the other fights, then the one who ran will get away unharmed (payoff of 0) while the one who fights will be killed (payoff -200). If they both run, then the bear will chase down one of them and eat them to death but the other one will get away unharmed. Assuming they don't know which one will escape we will call this a payoff of -100 for both. If they BOTH fight, then they will successfully drive off the bear but they may be injured in the process (payoff -20). Construct a payoff matrix for this game and identify the pure strategy Nash equilibrium. (Indicate it with words not with a circle!)
“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…
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.
Keith and Blake play a simultaneous one-shot game. Keith chooses between Top and Bottom, whereas Blake chooses between left and right. Payoffs are given by (Keith's payoffs are listed first and Blake's payoffs second): Top+left: 3,-6. Top+right:0,-7 Bottom+left:4,0. Bottom+right:-2,6. In a mixed strategy equilibria, Keith will play Top with what probability? 1. 6/7 2. 1/4 3. 1/2 4. 1/7 5. 0 6. 3/4
3. Suppose we play the following game. I give you $100 for your initial bankroll. At each time n, you decide how much of your current wealth to bet. You cannot borrow money. You can only play with the money I gave you in the beginning or any money that you have won so far. The game is simple. At each time n ≥ 1, you decide the amount to bet. I will roll a fair die. If the die comes up 1,2,3,..., or 5, you win; if the die comes up 6, then you lose. IOW, if you bet $10 on the first roll, you will either have $90 or $110 after the first roll. (a) Suppose you wish to maximize your profit on the first roll. How much should you bet? (Most of you will get this wrong.) (b) What is the expected profit on the first roll if your bet is b with 0 ≤ b ≤ 100? (c) Suppose you wish to maximize your expected profit on the first roll. How much should you bet? (d) Suppose you wish to maximize your expected profit betting on the nth roll. How much of your current wealth do you bet? (e) Let X₂, be your…
= a) Suppose x 4 and y = 3. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 1? b) Suppose x = 4 and y = 3. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 2? c) Suppose x = 4 and y = 3. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game? d) Suppose x = 4 and y = 11. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 1? e) Suppose x = 4 and y = 11. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, how many strategies remain for Player 2? f) Suppose x = 4 and y = 11. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game?