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

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

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 9MC

See similar textbooks

Related questions

Q: Theater 1 and Theater 2 are the only movie theaters in town. They each choose one of three prices…

A: Game Theory is a part of economics that studies the different ways the various choices of economic…

Q: Consider the following sequential game. Player 1 plays first, and then Player 2 plays after…

A: With the help of the nash equilibrium, firms attain their best strategy in a non-cooperative game.…

Q: Two Departments, A and B, in your company are choosing whether to implement the Excel or Xeon…

A: Given: A prefers Excel and B thinks Xeon will make their department more productive. If they…

Q: Dad baked a chocolate cake for his twins Jack and Mary on their birthday, and he wants Jack and Mary…

A: Jack's First Offer: Jack knows that Mom will get to consume half of the cake if Mary refuses his…

Q: Two oligopolistic aluminium manufacturers are engaged in bitter competition with one another. Both…

A: An oligopoly is type of market with a few sellers and a large number of buyers. The sellers compete…

Q: Consider the following game: Player 1 chooses A, B, or C. If player 1 chooses A, the game ends and…

A: The game tree describes all of the game's main parts, together with the participants, strategies,…

Q: Intel and AMD are the two dominant producers of microchip processors. The following matrix gives the…

A: The Nash equilibrium is the optimal outcome of a game where no player has an incentive to deviate…

Q: Suppose that two players are bargaining over the distribution of $1,000 in which payoffs must be in…

A: Yes, this game have a Nash equilibrium. Any combination of bids (a, b) where ‘a’ is the bid of…

Q: Consider the following information for a simultaneous-move game: two discount stores (megastore and…

A: The Nash Equilibrium arises in the above simultaneous-move game when both Megastore and Superstore…

Q: Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row…

A: Table below shows the game:

Q: Two firms A and B compete on price. They can choose a low or high price. Firm A is smaller than…

A: Game theory: - Game theory is the mathematical way of decision-making by different players competing…

Q: Jim is dealt two cards : ♡8 and ♠9. Angella is also dealt two cards: ♢6 and ♣6. Now, each of the…

A: Given: Jim is dealt two cards: ♡8 and ♠9. Angella is also dealt two cards: ♢6 and ♣6.

Q: Problem 3. Val and Earl are at work on a very hot afternoon. There is a job waiting for them. It…

A: Detailed explanation: C) Find the subgame perfect Nash equilibrium profile if X < 0.In this case,…

Q: Consider the following simultaneous-move game that represents the payoffs from different advertising…

A: The dominant strategy is the best course of action, irrespective of the rival firm's strategy. It is…

Q: QUESTION 100 Table 17-20 Nadia and Maddie are two college roommates who both prefer a clean common…

A: Game theory studies different strategies of players under different circumstances, and which…

Q: Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a…

A: A Nash equilibrium is a set of strategies, one for each player, with the property that no player can…

Q: Two street racers are playing a simultaneous game of chicken. They have to race towards each other…

A: Game theory provides a mathematical method to find the optimal solution between the two or more…

Q: Consider a market with two firms, Hewlett-Packard (HP) and Dell, that sell printers. Both companies…

A: Pure strategy Nash Equilibrium: Nash equilibrium with 2 players is the strategy profile where both…

Q: Table 17-9 Nadia and Maddie are two college roommates who both prefer a clean common space in their…

A: Game theory studies different strategies of players under different circumstances, and which…

Q: wo small towns that are located near each other are thinking of building a fancy new shopping mall…

A: The dominant strategy in game theory refers to the optimal choice of strategy among all strategies…

Question

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

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, economics and related others by exploring similar questions and additional content below.

Similar questions

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
Suppose that Kim and Nene are both in the public eye. They get offers to sell secrets of the other to tabloids. If both keep the secrets, they are both better off than if they get exposed. If only one is exposed, the other person is better off than if no one was exposed. Their payoffs from each option are given in the payoff matrix. Suppose that Nene and Kim play the game over four television seasons, where each season is a new game. Consider the scenarios. Remember, a tit‑for‑tat strategy is one where the person starts by cooperating and then plays whatever strategy the other firm played last. Over four seasons, how much will Nene make if she and Kim both play tit‑for‑tat? $ Over four seasons, how much does Nene make if she always exposes and Kim plays tit‑for‑tat? $ Over four seasons, how much will Nene make if she plays a tit‑for‑tat strategy and Kim always exposes? $ Over four seasons, how much will Nene make if she and…
Consider a game with two players A and B and two strategies X and Z. If both players play strategy X, A will earn $300 and B will earn $700. If both players play strategy Z, A will earn $1,000 and B will earn $600. If Player A plays strategy X and player B plays strategy Z, A will earn $200 and B will earn $300. If Player A plays strategy Z and player B plays strategy X, A will earn $500 and B will earn $400. Player B finds that: a) strategy Z is a dominant strategy. b) strategy X is a dominant strategy. c) he has no dominant strategy. d) strategy X is a dominated strategy. e) strategy Z is a dominated strategy.
In the game shown below, Players 1 and 2 are competing over how to divide up $100. Each player must move at the same time without knowledge of the other player’s move. The table shows the payoff for Player1 (Player 2’s payoff is $100 Player 1’s Payoff). Find the Nash equilibrium(s) for this game. That is, what strategy should Player 1 and Player 2 use for this game? If the Players use their optimal strategy, what will be the payoff for each player in this game? Player 2 Player 1 Left Middle Right Up 40 30 50 Middle 20 50 40 Down 30 20 30
Once again, two ice cream truck vendors, A and B, are playing a simultaneous pricing game. If only one of the vendors prices low, he gets all the customers for a payoff of 12, while the other vendor gets no customers and a payoff of zero. If both vendors price high, they each get a payoff of 6. If both price low, they each get a payoff of 5. Suppose that the above game is repeated indefinitely, and together the vendors adopt a trigger strategy such that they would start charging the low price only if the other vendor charged a low price last time. Provided that the vendors stick to their new strategy, what would be the Nash equilibrium going forward? a) Both the vendors price high b) Both the vendors price low c) Vendor A prices high, vendor B prices low d) Vendor B prices high, vendor A prices low
Consider the following game, called matching pennies, which you are playing with a friend. Each of you has a penny hidden in your hand, facing either heads up or tails up. You know which way the penny is facing in your own hand. On the count of three, you simultaneously show your pennies to each other. If the face-up side of your coin matches your friends, you get to keep both pennies. If they do not match, your friend gets to keep both. a. Who are the players in this game? What are each player’s strategies? b. Construct a payoff matrix for this game. c. Does either player have a dominant strategy? Explain d. Is there a Nash equilibrium? Explain.
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 -100). 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 -50 for both. If they BOTH fight, then they will successfully drive off the bear but they may be injured in the process (payoff -10). Construct a payoff matrix for this game and identify the pure strategy Nash equilibrium. (Indicate it with words not with a circle!)
Problem 3. Val and Earl are at work on a very hot afternoon. There is a job waiting for them. It takes only one person to do the job. The one who does it must crawl through a mucky culvert to connect a pipe. Once the pipe is connected, they can both go to a comfortable tavern for a beer. The game tree is shown below, where at the terminal nodes, the top number is Val's payoff and the bottom number is Earl's payoff. Val Do it Stall V 5 E 10 Earl Do it Stall 9 Val 4 Do it Stall 38 Earl Do it Stall 7 Val Do it Stall Earl 110 Do it Leave it 5 0 X X At the beginning of play, Earl is working on another job, but Val could do the job and if he does it right away, they can both go out for beer. Val could choose to stall, waiting for Earl to come back. If Val decides to stall, then when Earl gets back, he could do the job, or he could stall. If Earl chooses to stall, Val could either do the job, or stall again, and so on... If Val and Earl both stall until Earl's final decision node at the end…
Consider the following game: Player 1 chooses A, B, or C. If player 1 chooses A, the game ends and each player gets a payoff of $7. If player 1 chooses B, then player 2 observes their choice and plays X or Y. If player 1 chooses B and player 2 chooses X, the game ends. Player 1 gets a payoff of $14 and player 2 gets a payoff of $16. If player 1 chooses B and player 2 chooses Y, the game ends. Player 1 gets a payoff of $17 and player 2 gets a payoff of $14. If player 1 chooses Č, then player 2 chooses secretly to put either a $5 bill or a $20 bill into a sealed envelope. Player 1 does not observe his choice; rather she has two options: Open the envelope and gets whatever bill is inside. If she chooses this, player 2 gets nothing. Give the envelope back to player 2, and get $12 for sure. If she chooses this, player 2 gets the amount in the envelope. Draw the game tree for this game How many strategies does Player 1 have in this game?
Consider the following sequential move game played by three players, A, B and C. Player A moves first and chooses one of the following two payoff matrices, either Box 1 or Box 2. Following Player A's choice, Players B and C move simultaneously. Player B chooses one of two strategies, Top or Bottom, while Player C chooses one of two strategies, Left or Right. Player A; Box 1: Player B Player A; Box 2: Player B Top Bottom Top Bottom Player C Left 3,3,3 6,5,0 Player C Left 3,6,6 4, 10,0 Right 6,0,5 8, 1, 1 Right 4,0, 10 6,2,2 Each cell in the two boxes contains three numbers. The first number is the payoff to Player A, the second number is the payoff to Player B and the third number is the payoff to Player C. This implies that when choosing their respective strategies, Players B and C will consider the second and third payoff numbers respectively in each cell. Player A, of course, will focus on the first number in each cell in deciding which box to choose. What is the subgame perfect…
In a two-player, one-shot, simultaneous-move game, each player can choose strategy A or strategy B. If both players choose strategy A, each earns a payoff of $400. If both players choose strategy B, each earns a payoff of $200. If player 1 chooses strategy A and player 2 chooses strategy B, then player 1 earns $100 and player 2 earns $600. If player 1 chooses strategy B and player 2 chooses strategy A, then player 1 earns $600 and player 2 earns $100. a. Write this game in normal form. b. Find each player’s dominant strategy, if it exists. c. Find the Nash equilibrium (or equilibria) of this game. d. Rank strategy pairs by aggregate payoff (highest to lowest). e. Can the outcome with the highest aggregate payoff be sustained in equilibrium? Why or why not?
Consider the game shown below. In this game, players 1 and 2 must move at the same time without knowledge of the other player’s move. Player 1’s choices are shown in the row headings (A, B, C), Player 2’s choices are shown in the column headings (D, E, F). The first payoff is for the row player (Player 1) and the second payoff is for the column player (Player 2). Player 2 Player 1 D E F A 6, 8 4, 7 2, 9 B 2, 3 2, 6 4, 7 C 5, 4 7, 5 3, 6