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

Exploring Economics

8th Edition

ISBN:9781544336329

Author:Robert L. Sexton

Publisher:Robert L. Sexton

Chapter15: Oligopoly And Strategic Behavior

Section: Chapter Questions

Problem 17P

See similar textbooks

Similar questions

QUESTION 100 Table 17-20 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 payoff table for this situation is provided below, where the higher a player's payoff number, the better off that player is. The payoffs in each cell are shown as (payoff for Nadia, payoff for Maddie). Nadia Clean Don't Clean Maddie Clean (30, 30) (50, 7) Don't Clean (7,50) (10, 10) Refer to Table 17-20. If Maddie chooses not to clean, then Nadia will a clean, and Nadia's payoff will be 50. b. not clean, and Nadia's payoff will be 10. C. not clean, and Nadia's payoff will be 30. Od.clean, and Nadia's payoff will be 7.
Keith and Blake play a simultaneous one-shot game given by the following table: Blake Left Right Keith Top Bottom 4.00, -5.00 0.00, -6.00 5.00, 0.00 -2.00, 7.00 As there is no unique pure strategy Nash equilibrium, assume that each player plays each of his choices half of the time. What is the average payoff for Keith? | What is the average payoff for Blake? (Round to two decimals if necessary.) (Round to two decimals if necessary.)
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
Consider the following game represented in normal form. Terry and Kerry are roommates who must make decisions about cleaning. Terry's payoff is the fiırst 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 ]
Consider the following 3 person color game between Hillary, Ivanka, and Michelle. Each player can choose either Red or Blue. The payoffs for these choices are shown below. The first payoff in each cell is for Hillary, the second payoff is for Ivanka, and the third payoff is for Michelle. Michelle Red Ivanka Red Ivanka Blue Hillary Red 1, 1, 5 1, 2, 1 Hillary Blue 2, 1, 2 2, 2, 2 Michelle Blue Ivanka Red Ivanka Blue Hillary Red 6, 6, 6 2, 10, 2 Hillary Blue 7, 1, 3 3, 2, 3 Assume this game is only played one time. Determine whether each player has dominant strategy and the Nash equilibrium outcome to the game. Circle the correct answer.: The dominant strategy for Hillary is: Red Blue None The dominant strategy for Ivanka is: Red Blue None The dominant strategy for Michelle is: Red Blue None The Nash equilibrium outcome to the game is:…
Consider a sequential game where there are two players, Jake and Sydney. Jake really likes Sydney and is hoping to run in to her at a party this weekend. Sydney can't stand Jake. There are two parties going on this weekend and each player's payoffs are a function of whether they see one another at the party. The payoff matrix is as follows: Sydney Party 1 Party 2 Party 1 6, 18 18, 6 Jake Party 2 24,8 0,24 a) Does this game have a pure strategy Nash Equilibrium? b) What is the mixed strategy Nash Equilibrium? c) Now suppose Sydney decides what party she is going to first. Her roommate is friends with Jake and will call him to tell him which party they go to. Write the extensive form of this game (game tree). d) What is the subgame perfect Nash equilibrium from part c?
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.
7. Solving for dominant strategies and the Nash equilibrium Suppose Dmitri and Frances are playing a game in which both must simultaneously choose the action Left or Right. The payoff matrix that follows shows the payoff each person will earn as a function of both of their choices. For example, the lower-right cell shows that if Dmitri chooses Right and Frances chooses Right, Dmitri will receive a payoff of 7 and Frances will receive a payoff of 6. Frances Left Right Left 4, 3 6, 4 Dmitri Right 6, 7 7, 6 to choose The only dominant strategy in this game is for and Frances chooses The outcome reflecting the unique Nash equilibrium in this game is as follows: Dmitri chooses v
Consider the following sequential game. Wally first chooses L or H. Having observed Wally's choice, Elizabeth chooses between A and F. The payoffs are as follows. If Wally chose L and Elizabeth chose A, the payoffs are 30 to Wally and 20 to Elizabeth. If Wally chose L and Elizabeth F, the payoffs are 40 to Wally and 10 and to Elizabeth. If Wally decides to opt for H and Elizabeth A, the payoffs are 10 and 2 to Wally and Elizabeth, respectively. Finally, if Wally opts for H and Elizabeth F, the payoffs are 35 toWally and 5 to Elizabeth. What is the outcome in the subgame perfect equilibrium of this game? (L,F) (H,A) (H,F) and (L,F) (L,A) and (H,F) (H,F)
Make sure you clearly write your name and submission:. 1. 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 -1 0 1 rock 0 paper 1 scissors -1 (a) Show that this game does not have a pure Nash equilibrium. 1 X 3 (b) Show that…
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 paper 1 0 scissors 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors rock 0…
The game of Chicken is played by two teens who speed toward each other on a single-lane road. The first to veer off is branded the chicken, whereas the one who does not veer gains peer-group esteem. Of course, if neither veers, both die in the resulting crash. Payoffs to the Chicken game are provided in the following table. Team 2 Veer Does not veer Team 1 Veer 2, 2 1, 3 Does not veer 3, 1 0, 0 The first payoff number is for Teen 1 and the second number is for Teen 2. a) Does any of the players has a dominant strategy? b) Find the pure-strategy Nash equilibrium or equilibria. c) Suppose the game is played sequentially. Find the Nash equilibrium.