Info for the following two questions: Consider the sequential game below, with two players (1 and 2): 1 (3,5) 1 (4, 2) (5, 1) (0, 0) e (0,0) (2,4) The number next to the black nodes denote which player is picking the action. That is, player 1 starts; player 2 plays next unless player 1 picked c; and player 1 can play again if player 2 picked A. Question 13: What constitutes a pure strategy in this game? O The payoffs associated with the equilibrium outcome. For example, (2,4) describes a pure strategy.

Info for the following two questions: Consider the sequential game below, with two players (1 and 2): 1 (3,5) 1 (4, 2) (5, 1) (0, 0) e (0,0) (2,4) The number next to the black nodes denote which player is picking the action. That is, player 1 starts; player 2 plays next unless player 1 picked c; and player 1 can play again if player 2 picked A. Question 13: What constitutes a pure strategy in this game? O The payoffs associated with the equilibrium outcome. For example, (2,4) describes a pure strategy.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

Consider the game the following game: - Two players, six rounds of decision-making alternating between player 1 and 2, starting with player 1. - Game starts with $0.50. The player making the decision is given the option to Grab (80% of the money), or Leave it to double in the next round. - If player 2 picks Leave in the last round, she receives $6.40, and player 1 receives $25.60. Solve game via Backwards Induction.
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
PLAYER B LEFT RIGHT UP 5 FOR A, 30 FOR B 10 FOR A, 12 FOR B PLAYER A DOWN -2 FOR A, 10 FOR B 8 FOR A, 15 FOR B In the above game, the players are seeking to maximize the number they recieve. They choose at the same time. What is the Nash equillibrium? Player A will choose UP and player B will choose LEFT Player A will UP and player B will choose RIGHT Player A will choose DOWN and player B will choose LEFT Player A will choose DOWN and player B will choose RIGHT Player A will choose LEFT and player B will choose UP Player A will choose LEFT and player B will choose DOWN Player A will choose RIGHT and player B will choose UP Player A will choose RIGHT and player B will choose DOWN
Q14. Do players have perfect information in the above game? Yes, all of them have perfect information No, player 2 has imperfect information No, player 3 has imperfect information No, no player has perfect information Q15. If we want to describe the above game with a strategic form representation, what would the strategy sets for the three players be? Player 1={a, b, c} ; Player 2={x, y}; Player 3={r, s} Player 1={a, b, c} ; Player 2={xx, xy, yx, yy}; Player 3={r, s}
Consider a two-player, sequential-move game where each player can choose to play right or left. Player 1 moves first. Player 2 observes player 1’s actual move and then decides to move right or left. If player 1 moves right, player 1 receives $0 and player 2 receives $25. If both players move left, player 1 receives –$5 and player 2 receives $10. If player 1 moves left and player 2 moves right, player 1 receives $20 and player 2 receives $20. a. Write this game in extensive form. b. Find the Nash equilibrium outcomes to this game. c. Which of the equilibrium outcomes is most reasonable? Explain.
Consider the following dynamic game. There are two players (P1, P2). Player 2 tries to rob Player 1. If Player 1 pays $100, the game is over with Player 1 (victim) paying $100 to Player 2 (robber) (P1: -$100, P2: +$100). If Player 1 refuses to pay $100, then Player 2 has two choices: one is to hurt Player 1 (P1: -$5,000, P2: -$1,000) and the other is to walk away (P1: 0, P2: 0). Explain how to find an equilibrium in this game.
two players, a and b are playing an asymmetrical game. there are n points on the game board. each turn player a targets a pair of points and player b says whether those two points are connected or unconnected. a can target each pair only once and the game ends when all pairs have been targeted. player b wins if a point is connected with all other points on the very last turn, while player a wins if any point is connected with all other points on any turn but the very last one or if no point is connected to all other points after the last turn. for what values of n does either player have a winning strategy?
5 Suppose two players play one of the two normal-form games shown in Figure 1. L U 0,-1 D 2,4 R 2,0 6,0 L U | 4,-1 D 2,-2 R 2,0Now suppose that Player 2 knows which game is being played, but Player 1 does not. Find the pure strategy Bayesian Nash equilibrium of this game.
Consider the following game played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
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. For example, a payoff 100/200 would mean Player 1 receives 100 and Player 2 receives 200.What is [are] the Nash Equilibrium [Equilibria] of this game?A) (10/10) and (20/20)B) (30/30)C) (10/20) and (20/10)D) (20/20)E) (30/30)
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
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?)