Table 17-9 Nadia and Maddie are two college roommates who both prefer a clean common space in their dorm room, but neither enjoys cleaning. The roommates must each make a decision to either clean or not clean the dorm room's common space. The following table shows the payoffs for this situation, where the higher a player's payoff number, the better off that player is. Nadia Refer to Table 17-9. If Maddie chooses not to clean, then Nadia will O a. not clean, and Nadia's payoff will be 10. O b. clean, and Nadia's payoff will be 7. O c. not clean, and Nadia's payoff will be 30. O d. clean, and Nadia's payoff will be 50. Clean Don't Clean Clean Maddie = 30 Nadia - 30 Maddie = 7 Nadia = 50 Maddie Don't Clean Maddie = 50 Nadia 7 Maddie = 10 Nadia = 10

Table 17-9 Nadia and Maddie are two college roommates who both prefer a clean common space in their dorm room, but neither enjoys cleaning. The roommates must each make a decision to either clean or not clean the dorm room's common space. The following table shows the payoffs for this situation, where the higher a player's payoff number, the better off that player is. Nadia Refer to Table 17-9. If Maddie chooses not to clean, then Nadia will O a. not clean, and Nadia's payoff will be 10. O b. clean, and Nadia's payoff will be 7. O c. not clean, and Nadia's payoff will be 30. O d. clean, and Nadia's payoff will be 50. Clean Don't Clean Clean Maddie = 30 Nadia - 30 Maddie = 7 Nadia = 50 Maddie Don't Clean Maddie = 50 Nadia 7 Maddie = 10 Nadia = 10

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

Alice and Julia want to spend time together but have different preferences for their activities. They can choose between two options: going to a soccer game or watching a football game. Alice prefers football and Julia prefers the football game, but they both prefer being together over being apart. If they both choose to attend a soccer game then Julia receives a payoff of 2 and Alice a payoff of 1. If they both choose to attend a football game, then Julia receive a payoff of 1 and Alice a payoff of 2. If one chooses a football game and the other a soccer game then they both receive a payoff of O. The payout matrix below illustrates these payoffs. Which of the following statements are true: I. There is a dominant strategy II. A nash equilibrium exists where Alice attends a football game and Julia attends a soccer game III. A nash equilibrium exists where both friends attend a soccer game IV. Both attending a football game is a stable outcome. Alice Soccer Football Julia Soccer Football…
In the game shown below, Player 1 can move Up or Down, and Player 2 can move Left or Right. The players must move at the same time without knowledge of the other player’s move. The first payoff is for the row player (Player 1) and the second payoff is for the column player (Player 2). Solve each game using game theoretic logic. Player 2 Player 1 Left Right Up 7, 7 2, 9 Down 9, 2 1, 3
Three politicians are voting on whether to allow themselves a salary increase of$3,500per a year. If they vote in favor of a raise, then they lose some public support, costing them each$1,500 per year. The salary increase passes if two or more politicians vote in favor of it. What is this game’s Nash equilibrium (or equilibria)? Explain. There is no need to draw a payoff matrix.
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
Alice and Betsy are playing a game in which each can play either of two strategies, leave or stay. If both play the strategy leave, then each gets a payoff of $400. If both play the strategy stay, then each gets a payoff of $800. If one plays stay and the other plays leave, then the one who plays stay gets a payoff of $C and the one who plays leave gets a payoff of $D. When is the outcome where both play leave a Nash equilibrium? a) never, since 800 > 400 b) when 400 > C and D > 800 but not when 800 > D c) whenever 400 > C d) when D > C and C > 400 e) whenever d < 800
Let's think about a traditional game theory principal agent game. In this game we have two players, Lauren and Jason Lauren will choose to invest $500 dollars with Jason If she doesn't invest the money, she keeps the $500 and Jason gets nothing If she does invest the money, then Jason has a choice-he can cooperate by investing Lauren's money and then splitting the profit of another $500. This would give Lauren $750 (her original $500 investment plus $250 of profit) and would give Jason $250. Jason's other choice is to appropriate, or to steal Lauren's money and not invest it. If he does this, Lauren ends up with nothing and Jason has the entire $500. The following diagram outlines this game. Principal Agent Game Jason (750.250) Invest appropriate 10. 500) doninve What will happen in this game? Lauren will not invest Lauren will invest and Jason will cooperate Lauren will invest and Jason will appropriate Next page
5. A game of Chicken is played by two lorry drivers who speed toward a narrow bridge. If one driver stops to let the other pass, they waste time, whereas the one who does not stop gets to their destination quicker. However, if both keep driving straight on then they crash. The game is played once, and drivers move simultaneously. Payoffs are given below (assume 0 < x < 10): Drive Stop Drive -10,-10 -x, 8 Stop 8,-1 0,0 (a) Find any pure strategy Nash equilibria of this game. (b) Find the mixed strategy Nash equilibrium of this game. (c) What happens to the column player's equilibrium mixed strategy as x increases? Explain why this happens. (d) Let x = 1. What are the rationalizable outcomes of this game? Do these offer a better prediction than the Nash equilibria?
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?
5
Return to the game between Monica and Nancy in Exercise U10 in Chapter 5. Assume that Monica and Nancy choose their effort levels sequentially instead of simultaneously. Monica commits to her choice of effort level first. On observing this decision, Nancy commits to her own effort level. What is the subgame - perfect equilibrium of the game where the joint profits are 5m + 4n+ mn, the costs of their efforts to Monica and Nancy are m2 and n2, respectively, and Monica commits to an effort level first? Compare the payoffs to Monica and Nancy with those found in Exercise U10 in Chapter 5. Does this game have a first-mover or second - mover advantage? Using the same joint profit function as in part (a), find the subgame - perfect equilibrium for the game where Nancy must commit first to an effort level. U10. Return to the game between Monica and Nancy in Exercise U10 in Chapter 5. Assume that Monica and Nancy choose their effort levels sequentially instead of simultaneously. Monica commits…
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…
None