Consider the following game where two players must simultaneously announce an integer number between 1 and 5. If you announce a number which is 1 lower than the opponent your payoff is 10,otherwise it is 0. Which of the following statements is true?All outcomes of the game are rationalizable.This game has no Nash equilibrium in pure strategies.This game has a unique pure strategy Nash equilibrium.A strictly dominant strategy exists for at least one player.More than one of the above.No Answer

The mathematical analysis and study of decision-making in circumstances where the result of one…

Consider the following game where two players must simultaneously announce an integer number between 1 and 5. If you announce a number which is 1 lower than the opponent your payoff is 10 otherwise it is 0. Which of the following statements is true? O All outcomes of the game are rationalizable. O This game has no Nash equilibrium in pure strategies. O This game has a unique pure strategy Nash equilibrium. O A strictly dominant strategy exists for at least one player. O More than one of the above. O No Answer

Consider the following game where two players must simultaneously announce an integer number between 1 and 5. If you announce a number which is 1 lower than the opponent your payoff is 10 otherwise it is 0. Which of the following statements is true? O All outcomes of the game are rationalizable. O This game has no Nash equilibrium in pure strategies. O This game has a unique pure strategy Nash equilibrium. O A strictly dominant strategy exists for at least one player. O More than one of the above. O No Answer

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

See similar textbooks

Similar questions

Consider the following sequential strategic situation, called the centipede game. The game has 100 stages. Two players take turns making decisions, starting with player 1. At stage t = 1,...,99, player 1 (if the stage is odd) or player 2 (if the stage if even) chooses whether to "Terminate the game" or to "Continue the game." If the game is terminated instage t = 1,...,99, the player terminating the game receives a payoff of t, while the other player receives a payoff of zero. Finally, at stage t = 100, player 2 chooses between action A with a payoff of 99 for each player, or action B with a payoff of zero for player 1 and a payoff of 100 for player 2. Draw the game tree for this situation. What is the SPNE?
Two firms, X and Y, are planning to market their new products. Each firm can develop TV, Laptop. Market research indicates that the resulting profits to each firm for the alternative strategies are given by the following payoff matrix : MATRIX IS ATTACHED Find the Nash equilibria for this game, assuming that both firms make their decisions at the same time. (explain the decision step by step) If each firm is risk averse and uses a maximin strategy, what will be the resulting equilibrium? (explain the decision step by step) What will be the equilibrium if Firm X makes its selection first? If Firm Y goes first?
If a game has a mixed strategy Nash equilibrium then which of the following statements is true? There is at least two pure strategy Nash equilibrium. There are at least two rationalizable strategies. Players prefer any pure strategy Nash equilibrium to the mixed strategy Nash equilibrium. Players always prefer to mix when the other player mixes. None of the above.
We consider a game between two players, Alice and Bob. Alice chooses a number x (between -infinity and +infinity), and Bob chooses a number y (between -infinity and +infinity). Alice's payoff is given by the following function: 35 x + 87 x y - 95 x squared. (the last entry is "x squared".) Bob's payoff is given by the following function: 30 y + 42 x y + 75 y squared. (the last entry is "y squared".) Calculate Alice's strategy in the (unique) Nash equilibrium of this game.
Two individuals are bargaining over the distribution of $100 in which payoffs must be in increments of $5. Each player must submit a one-time bid. If the sum of the bids is less than or equal to $100, each player gets the amount of the bid and the game ends. If the sum of the bids is greater than $100, the game ends and the players get nothing. Does this game have a Nash equilibrium? What is the most likely equilibrium strategy profile for this game?
Consider a game where player A moves first, choosing between Left and Right. Then, after observing player A’s choice, player B moves next choosing between Up and Down. Which of the following is true? This is a game where players A and B have the same number of strategies. Player A will get a higher payoff than player B as A moves first. This is game will only have one Nash equilibrium. This is a game of perfect information.
Consider the following game. Which one of the following statements is TRUE? 1. There are 8 subgames for this extensive-form game. 2. There are 8 proper subgames for this extensive-form game. 3. There is no Subgame Nash Equilibrium for this game. 4. There exists some Subgame Nash Equilibrium that gives the payoff 7 to Player 1 and 3 to Player 2.
Which of the following is FALSE for the grim trigger strategy and the infinite horizon repeated Prisoner's Dilemma game illustrated above? A. In the grim trigger strategy profile, if a player chooses D in a period, then both players chooses D forever after that period B. The threshold discount factor for sustaining cooperation under grim trigger strategy depends on the utility numbers in the stage game C. If all utility numbers remain the same but 3 is replaced by 5 in the stage game, then cooperation CANNOT be sustained in this game for all possible values of the discount factor.
For a two-player game, the payoff function for player 1 is V1(x1, x2) = x1 + 10x1x2and for player 2 is V2(x1, x2) = x2 + 20x1x2.Player 1’s strategy set is the interval [0,100], and player 2’s strategy set is theinterval [0,50]. Find all Nash equilibria.
Consider a coordination game where each of two agents picks a number between 1 and 1000. The players get a prize of $1000 each if their numbers are the same, and $0 otherwise. In this game, there exists(A) a thousand of pure-strategy Nash equilibria;(B) an iterated dominant-strategy equilibrium;(C) a dominant strategy equilibrium;(D) none of the above.