Consider a simultaneous-move integer game between two players: Marilyn and Noah. Each of the player is required to announce a positive integer between 1 to 4. In other words, a player can announce 1, 2, 3, or 4. Two players announce their integers simultaneously. Notice that this game is different from the games we learned in class in that each player has four actions to take. The payoffs of the players in the game are specified as follows: (1) when the two announced integers are different, whoever reports the lower number pays $1 to the other player, so that the loser of the game has payoff -1 and the winner of the game has payoff 1; (2) when the two players announce the same integer, their payoffs are both 0. What is Marilyn's maximin strategy? 01 02

Consider a simultaneous-move integer game between two players: Marilyn and Noah. Each of the player is required to announce a positive integer between 1 to 4. In other words, a player can announce 1, 2, 3, or 4. Two players announce their integers simultaneously. Notice that this game is different from the games we learned in class in that each player has four actions to take. The payoffs of the players in the game are specified as follows: (1) when the two announced integers are different, whoever reports the lower number pays $1 to the other player, so that the loser of the game has payoff -1 and the winner of the game has payoff 1; (2) when the two players announce the same integer, their payoffs are both 0. What is Marilyn's maximin strategy? 01 02

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

Suppose Rashard and Alyssa are playing a game that requires both to simultaneously choose an action: Up or Down. The payoff matrix that follows shows the earnings of each person as a function of both of their choices. For example, the upper-right cell shows that if Rashard chooses Up and Alyssa chooses Down, Rashard will receive a payoff of 4 and Alyssa will receive a payoff of 5. Alyssa Up Down Rashard Up 8, 4 4, 5 Down 5, 4 6, 5 In this game, the only dominant strategy is for to choose . The outcome reflecting the unique Nash equilibrium in this game is as follows: Rashard chooses and Alyssa chooses.
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
Suppose Antonio and Trinity are playing a game that requires both to simultaneously choose an action: Up or Down. The payoff matrix that follows shows the earnings of each person as a function of both of their choices. For example, the upper-right cell shows that if Antonio chooses Up and Trinity chooses Down, Antonio will receive a payoff of 7 and Trinity will receive a payoff of 5. Trinity Up Down Up 4,8 7,5 Antonio Down 3,2 5,6 In this game, the only dominant strategy is for to choose The outcome reflecting the unique Nash equilibrium in this game is as follows: Antonio chooses, and Trinity chooses Grade It Now Save & Continue Continue without saving @ 2 F2 #3 80 Q F3 MacBook Air 44 F7 Dll F8 44 F10 74 $ 4 05 Λ & % 5 6 7 8 * 0 Q W E R T Y U 1 A N S X 9 0 -O O D F G H J K L on را H command C > B N M Λ - - P [ H Λ command opti
M5
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!)
Team 2 plays A Team 2 plays B Team 2 plays C Team 1 plays A 9, 9 8, 12 6, 6 Team 1 plays B 6, 6 0, 7 5, 5 Team 1 plays C 12, 8 10, 10 7,0 Consider the simultaneous move game above in which two teams are competing against each other. Which of the following statements are true? In all Nash Equilibria of the game Team 2 plays B This game has two Nash Equilibria Team 1's best response to team 2 playing B is to play A. O None of the other answers are correct This game has a mixed strategy Nash Equilibria where a player randomizes over multiple options.
Consider a simultaneous game where player A has a dominant strategy and player B has two strategies (none of which is a dominant strategy). How many pure strategy Nash equilibria will this game have? A) Exactly 1 B) Exactly 2 C) Either 1 or 2 D) None
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
Keith and Blake play a simultaneous one-shot game. Keith chooses between Top and Bottom, whereas Blake chooses between left and right. Payoffs are given by (Keith's payoffs are listed first and Blake's payoffs second): Top+left: 3,-6. Top+right:0,-7 Bottom+left:4,0. Bottom+right:-2,6. In a mixed strategy equilibria, Keith will play Top with what probability? 1. 6/7 2. 1/4 3. 1/2 4. 1/7 5. 0 6. 3/4
Define a new game as a modified version of the game in Problem 1, which we will call the Matching Two Pennies game: each player choose heads (H) or tails (T) for two pennies. In this game, Player 1 wins if both coins show the same combination of heads and tails, while Player 2 wins if they do not. (a) Write the strategy sets S1 and S2 for this game. (b) Give the payoffs for each player in this Matching Two Pennies game, by defining T;(81, 82) for each player and for each strategy pair, either as a list or in matrix form.
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 -1 1 paper 1 0 scissors -1 1 -1 0 2. Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper…
Player A and B each announce a color (red, white, blue, or green) simultaneously. The winner is determined by the following rules: red beats white, white beats blue, blue beats green, and green beats red. If both players announce the same color the game is a draw. The payoffs work as follows, if player A wins with red, she wins 5, if player A wins with white or blue, she wins 2, and if player A wins with green, she wins 3. If player B wins with red or white, he wins 4, if player B wins with blue he wins 3, and if player B wins with green he wins 5. The above description leaves out the cases where players announce colors that are not directly comparable. For example, there is no rule for what happens if one player announces white and the other announces green. In these situations, the winner is determined by examining the number of letters in each color that is announced. If both colors have the same number of letters, then the game is a draw. If there are a different number of letters…