Consider the following simultaneous-move game that represents the payoffs from different advertising campaigns (low, medium, and high spending) for two political candidates that are running for a particular office. The values in the payoff matrix represent the share of the popular vote earned by each candidate is given below. T equilibrium in dominant strategies Candidate A-low Candidate A-medium Candidate A-high Candidate B-low Candidate B-medium Candidate B-high 50, 50 60, 40 80, 20 40, 60 50, 50 65, 35 20, 80 35,65 50, 50

Consider the following simultaneous-move game that represents the payoffs from different advertising campaigns (low, medium, and high spending) for two political candidates that are running for a particular office. The values in the payoff matrix represent the share of the popular vote earned by each candidate is given below. T equilibrium in dominant strategies Candidate A-low Candidate A-medium Candidate A-high Candidate B-low Candidate B-medium Candidate B-high 50, 50 60, 40 80, 20 40, 60 50, 50 65, 35 20, 80 35,65 50, 50

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

Consider the strategic voting game discussed at the endof this chapter, where we saw that the strategy profile (Bustamante, Schwarzenegger,Schwarzenegger) is a Nash equilibrium of the game. Show that (Bustamante, Schwarzeneg-ger, Schwarzenegger) is, in fact , the only rationalizable strategy profile. Do this by firstconsidering the dominated strategies of player L. (Basically, the question is asking youto find the outcome of the iterative elimination of strictly dominated strategies)
You are playing a game with a friend. It’s yourmove but you don’t have a dominant strategy.Your payoff depends on what your friend doesafter your move. You consider flipping a coin todecide what to do. You are about to reach for acoin, but then you realize that your friend has adominant strategy. Explain how using backwardinduction (rather than a coin toss) will now determine your next move
Solve for the Nash equilibrium (or equilibria) in each of the following games. (a) The following two-by-two game is a little harder to solve since firm 2’spreferred strategy depends of what firm 1 does. But firm 1 has a dominantstrategy so this game has one Nash equilibrium. Firm 2 Launch Don’tFirm 1 Launch 60, -10 100, 0 Don’t 80, 30 120, 0 What is the Nash equilibrium of this simultaneous-move game? (b) What would the outcome of this game be if instead firm 1 moved first and then, after seeing what firm 1 chose, firm 2 chose it strategy? In this case firm 1 doesn’t necessarily need to choose a best response, but firm 2 must choose a best response since it moves second.
Two farmers, Ali and Hasan, graze their animals on a common land. They canchoose to use the common resource lightly or heavily and the resulting strategic interactionmay be described as a strategic form game. The payoff matrix is the following: (The table is attached on iamges part) Suppose that the game is repeated infinitely. If both players play a Grim-Trigger strategy, findthe discount factor δ such that (Light,Light) be a Nash equilibrium
Consider the following simultaneous game: Player 1 U D Player 2 L 20,-10 -10, 20 R -10, 20 20,-10 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has a Nash equilibrium. This game has a Nash equilibrium in pure strategies. Player 1's best response is D if player 2 plays R.
In a game theory payoff matrix. Your company (A) and a major competitor (B) havetwo potential strategies: to advertise or to not advertise during the Super Bowl. The payoffs in each cell represent the change in firm profits from advertising. How would you create payoffs in each cell such that the Nash equilibrium is that both firms advertise despite having a higher profit if neither firm advertised
GAME UUU B1 Player B B2 A1 7,13 5, 10 A2 3,8 9,16 Player A A3 5,8 4,7 In Game UUU (see table above), assuming players move simultaneously, Player A choosing A1 and Player B choosing B3 is a Nash equilibrium. Player A choosing A3 and Player B choosing B2 is a Nash equilibrium. Both Player A choosing A1 and Player B choosing B1 and Player A choosing A2 and player B choosing B2 are Nash equilibria in pure strategies Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.
Consider the extensive form game portrayed below. The top number at aterminal node is player 1’s payoff, the middle number is player 2’s payoff,and the bottom number is player 3’s payoff.a. Derive the strategy set for each player. (Note: If you do not want to listall of the strategies, you can provide a general description of a player’sstrategy, give an example, and state how many strategies are in thestrategy set.)b. Derive all subgame perfect Nash equilibria. c. Derive a Nash equilibrium that is not a SPNE, and explain why it isnot a SPNE.
(a) Design a two-player game with the property that "the payoff for Player1 is Playerl plays a strategy Sl and Player2 plays a strategy S2 is the same as the payoff for Player2 if Player2 plays Sl and Playerl plays S2". Express your game in terms of payoff matrices. Show the above property holds in your given payoff matrices. Give a case to show that there is one Nash equilibrium and such an equilibrium is also a Pareto efficient (justify your answers) in your given payoff matrices. Prove or disprove the above case that is unique. Give another example to show that there are two Nash equilibria in your given payoff matrices.
The following payoff matrix shows the possible sentence that two suspects , who are arrested on suspicion on car threft,could recieve. The suspects are intarogated seperately and are unable to communicate with one another. For the information given in the payoff matrix above: a. Is there a dominant strategy. b. What is the dominant strategy? How do you know? c. Is there a Nash equilibirium ? How do you know?
Consider this as a simultaneous-move (static) game: Player A Top Bottom Player B Left Right ETEL UU 1.b) Does any player have a dominant strategy in this game? Explain. 1.a) Write down the Best Response Correspondence for each of the two players. Molimonsbestich Quinit 1.c) Find all Nash Equilibria in pure strategies of this game. 1.d) Is there any Nash Equilibria in mixed strategies? If so, find it. Elekt
Consider the following simultaneous game: Player 1 U D Player 2 L 30,20 -10, -10 R -10, -10 20,30 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has two Nash equilibria in pure strategies. Player 1's payoff in each of the Nash equilibria is 30.