Olivia is thinking about opening a new bakery (the entrant). There is already a bakery open in her neighborhood (the incumbent), and the owner of the incumbent bakery makes it clear that if Olivia enters the market, they will cut their prices in an attempt to drive the new bakery out of business. Based on the payoff matrix below, is the incumbent’s threat credible? That is, if Olivia opens a new bakery, will the incumbent actually lower their prices? Note: the entrant chooses the row, the incumbent chooses the column High price Low price Enter 1, 2 -1, 1 Don’t enter 0, 10 0, 1 a. Yes, the threat is credible b. No, the threat is not credible

Olivia is thinking about opening a new bakery (the entrant). There is already a bakery open in her neighborhood (the incumbent), and the owner of the incumbent bakery makes it clear that if Olivia enters the market, they will cut their prices in an attempt to drive the new bakery out of business. Based on the payoff matrix below, is the incumbent’s threat credible? That is, if Olivia opens a new bakery, will the incumbent actually lower their prices? Note: the entrant chooses the row, the incumbent chooses the column High price Low price Enter 1, 2 -1, 1 Don’t enter 0, 10 0, 1 a. Yes, the threat is credible b. No, the threat is not credible

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 2MC

See similar textbooks

		High price		Low price
Enter		1, 2		-1, 1
Don’t enter		0, 10		0, 1

Similar questions

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…
Consider the following entry-deterrence game. A potential entrant has two strategies, “Enter” or “Stay Out”. An incumbent firm can either Price Low or Price High, depending on whether they want to try to fight or accommodate the entrant. (The Price Low option could be a limit price, for example). Suppose if the entrant Enters and the incumbent Prices Low, both firms lose $-1M. If the entrant enters and the incumbent Prices High, each firm earns $2M. If the Entrant doesn’t enter, the incumbent earns $4M and the entrant earns $0. a)Using the concept of Nash Equilibrium, what are the predicted strategies and profits? Set up a game box or tree and explain your reasoning. b) Give an example of a different profit outcome that would lead to a different Nash Equilibrium. (From this, you can see that sometimes deterrence is effective and sometimes it isn’t, depending on the profits).
Consider a game in which player 1 first selects between I and O. If player 1 selects O, then the game ends with the payoff vector (x, 1) (x for player 1), where x is some positive number. If player 1 selects I, then this selection is revealed to player 2 and then the players play the battle-of-the-sexes game in which they simultaneously and independently choose between A and B. If they coordinate on A, then the payoff vector is (5, 1). If they coordinate on B, then the payoff vector is (1, 5). If they fail to coordinate, then the payoff vector is (0, 0). c) Calculate the mixed-strategy Nash equilibria and note how they depend on x. d) Represent the proper subgame in the normal form and find its equilibria.
In 'the dictator' game, one player (the dictator) chooses how to divide a pot of $10 between herself and another player (the recipient). The recipient does not have an opportunity to reject the proposed distribution. As such, if the dictator only cares about how much money she makes, she should keep all $10 for herself and give the recipient nothing. However, when economists conduct experiments with the dictator game, they find that dictators often offer strictly positive amounts to the recipients. Are dictators behaving irrationally in these experiments? Whether you think they are or not, your response should try to provide an explanation for the behavior.
QUESTION 9 Consider the following sequential entry deterrance game. Player 1 plays first, and then Player 2 plays after observing the choice of Player 1. At the bottom of the decision tree, the first number represents the payoff of Player 1, while the second number represents the payoff of Player 2. Player 2 L (2,4) a Player 1 R (4,2) In this game, Player 2 has an incentive to threaten L, which would be credible. an incentive to threaten R, which wouldn't be credible. an incentive to threaten L, which wouldn't be credible. an incentive to threaten R, which would be credible. Player 2 (3,8)
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), Player 2’s choices are shown in the column headings (C/D). The first payoff is for the row player (Player1) and the second payoff is for the column player (Player 2). Player 2 Player 1 C D A 8, 3 2, 4 B 7, 4 3, 5 Pick the correct answer: Player 1: Has a dominant strategy to choose A Has a dominant strategy to choose B Has a dominant strategy to choose C Has a dominant strategy to choose D Does not have a dominant strategy Player 2: Has a dominant strategy to choose A Has a dominant strategy to choose B Has a dominant strategy to choose C Has a dominant strategy to choose D Does not have a dominant strategy The Nash equilibrium outcome to this game is: A/C A/D B/C B/D There is no pure strategy Nash equilibrium for this game
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!)
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does Jerry have any strictly dominant strategy? Does Elaine?
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does this game have a Nash Equilibrium? (If not, why not? If yes, what is the Nash Equilibrium?)
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?
Question 1 Consider the following game. Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions (Left, Middle, Right). Each player chooses their action simultaneously. The game is played only once. The first element of the payoff vector is player 1’s payoff. Note that one of the payoffs to player 2 has been omitted (denoted by x). 1. Determine the range of values for x such that Player 2 has a strictly dominant strategy.
Problem 3. Consider the following two-player game. Player 1 (the row player) has three strategies {U, F, D}, and Player 2 (the column player) has four strategies {L, M, N, R}. In each cell, the first number is the pay-off of Player 1, and the second is that of Player 2. There is an unknown x in the table. Consider pure strategies only. U F D L (0, 3) (6,0) (3, 1) M (1,0) (5, 1) (4,2) N (2,5) (x, 2) (1, 1) R (4,2) (5, 1) (1, 3) (1) Find a number x such that {F, N} is the unique Nash equilibrium. (2) Find a number x such that the game has more than one Nash equilibria. What are these Nash equilibria in this case? (3) Is it possible to find a number x such that the game has no Nash equilibrium? For each of your answers above, an explanation needs to be provided.