Player 1 has two options: L and R. If Player 1 chooses L, then Player 2 has two options; she can choose A or B. If Player 2 chooses A payoffs are (2; 1) and if she chooses B payoffs are (1; 2). If Player 1 chooses R, then Player 2 has two options; she can choose Y or N. If Player 2 shows Y payoffs are (0; 3) and if she chooses N payoffs are (1; 2). Which of the following statements is true? O A. (L; B,Y ) is a subgame perfect equilibrium of this game O B. (R; B,N ) is a subgame perfect equilibrium of this game O C (L; A,Y ) is a subgame perfect equilibrium of this game O D. (R; B,Y ) is a subgame perfect equilibrium of this game

Player 1 has two options: L and R. If Player 1 chooses L, then Player 2 has two options; she can choose A or B. If Player 2 chooses A payoffs are (2; 1) and if she chooses B payoffs are (1; 2). If Player 1 chooses R, then Player 2 has two options; she can choose Y or N. If Player 2 shows Y payoffs are (0; 3) and if she chooses N payoffs are (1; 2). Which of the following statements is true? O A. (L; B,Y ) is a subgame perfect equilibrium of this game O B. (R; B,N ) is a subgame perfect equilibrium of this game O C (L; A,Y ) is a subgame perfect equilibrium of this game O D. (R; B,Y ) is a subgame perfect equilibrium of this game

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.8P

See similar textbooks

Similar questions

Consider the game of Chicken in which each player has the option to “get out of the way” and “hang tough” with payoffs: Get out of the way Hang tough Get out of the way 2,2 1,3 Hang tough 3,1 00 a. Find all pure strategy Nash equilibria, if they exist b. Let k be the probability that player 1 chooses “hang tough” and u be the probability that player two chooses “hang tough.” Find the mixed stragety Nash equilibria, if they exist
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!)
Consider the following two person game. Player 1 begins the game by choosing A or B. If Player 1 chooses A the game ends and Player 1 receives $100 and Player 2 receives $100. If Player 1 chooses B then Player 2 must choose C or D. If Player 2 chooses C then Player 1 receives $150 and Player 2 receives $250. If Player 2 chooses D then Player 1 receives $0 and Player 2 receives $400. Draw the complete game tree for this situation. Be sure to accurately label the tree and include the payoffs. Using backwards induction (look forward and reason backwards) determine the rational outcome to this game. Given how experimental subjects have behaved in the Ultimatum game, provide a behavioral explanation for why an “average” Player 1 and 2 might deviate from the rational prediction.
A strategy is a decision rule that describes the actions a player will take at each decision point. The normal-form game indicates the players in the game, the possible strategies of the players, and the payoffs to the players that will result from alternative strategies. In the game presented in Table Normal-Form Game, does player B have a dominant strategy? What is the secure strategy for player B in the game presented in Table Normal-Form Game?
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, D), Player 2’s choices are shown in the column headings (E, F, G). The first payoff is for the row player (Player1) and the second payoff is for the column player (Player 2). Player 2 Player 1 E F G A 2, 7 7, 2 2, 6 B 5, 5 5, 4 8, 4 C 4, 6 8, 4 7, 5 D 1, 6 3, 5 6, 4 Highlight 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 E Has a dominant strategy to choose F Has a dominant strategy to choose G Does not have a dominant strategy The Nash equilibrium outcome to this game is: A/F B/E B/G C/F C/G There is no pure strategy Nash…
Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row (10, 20, or 30), and Player 2 chooses a column (10/20/30). Payoffs are in the cells of the table, with those on the left going to Player 1 and those on the right going to player 2. Suppose that Player 1 chooses his strategy (10, 20 or 30), first, and subsequently, and after observing Player 1’s choice, Player 2 chooses his own strategy (of 10, 20 or 30). Which of the following statements is true regarding this modified game? I. It is a simultaneous move game, because the timing of moves is irrelevant in classifying games.II. It is a sequential move game, because Player 2 observes Player 1’s choice before he chooses his own strategy.III. This modification gives Player 1 a ‘first mover advantage’. A) I and IIB) II and IIIC) I and IIID) I onlyE) II only
10 1. Consider the game where initially She chooses between "Stay Home" and "Go Out". If She chooses "Stay Home" then She gets 2 and He gets 0. If She chooses "Go Out" then they each simultaneously choose "Movie" or "Concert" where the payoffs are 0,1 or 3 as in the Battle of the Sexes Game. What are the subgame perfect Nash Equilibria of this game ?
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
Please find herewith a payoff matrix. In each cell you find the payoffs of the players associated with a particular strategy combination: The first entry is the payoff of player 1, the second entry is the payoff of player2. Player 2 t1 t2 t3 Player 1 S1 3, 4 1, 0 5, 3 S2 0, 12 8, 12 4, 20 S3 2, 0 2, 11 1, 0 Suppose both players select their strategies (S1, S2 or S3 for player 1 and t1, t2 or t3 for player 2) simultaneously and that the game is played once. In your explanation to the questions below, please do refer to the figures in the matrix. Suppose player 2 could move before player 1 (i.e. has a first mover advantage). In your explanation to the questions below, please do refer to the figures in the matrix. What strategy would (s)he select? Is it really an ‘advantage’ for player 2 to move first? Or does player 2 benefit from being the second mover (and hence player 1 moving first)? I.e. for this question, do not make a comparison to the outcome of the…