In a variation of the coin game, there are 22 coins. Two players take turns and take between 1 and 3 coins each time. The player who takes the last coin loses the game. We may consider this a sequential game and thus could model this using an extensive form game. To win this game, the first mover should take Group of answer choices

In a variation of the coin game, there are 22 coins. Two players take turns and take between 1 and 3 coins each time. The player who takes the last coin loses the game. We may consider this a sequential game and thus could model this using an extensive form game. To win this game, the first mover should take Group of answer choices

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

Two workers are on a production line. They each have two actions: exert effort, E, or shirk, S. Effort costs a worker e > 0 and shirking costs them nothing. If two workers do action E a lot of output is produced and the workers earn £3 each. If only one worker chooses action E less output is produced and they both earn £1. The workers earn nothing if they both shirk. (i) Describe this situation as a strategic form game (assuming the workers do not observe each other's effort choice when making their own decision). (ii) For what values of e does this game have strictly dominant strategies? (iii) Describe the Nash equilibria of this game for e = 0,1, 2, 3. (iv) The workers now are re-arranged into a production line. First worker 1 moves and then worker 2 moves. Worker 2 can now see worker l's effort level before they choose their effort. Draw this extensive form game. (v) Find the subgame perfect equilibria of the production-line game for c = 1/2 and c = 3/2.
Game theory 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. Player 2 7. Player 1 ہے A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
Exercise 6.8. Consider the following extensive-form game with cardinal payoffs: 1 R O player pay 000 2 1 M 3 b 010 O player 3's payoff 1 2 221 2 000 0 0 (a) Find all the pure-strategy Nash equilibria. Which ones are also subgame perfect? (b) [This is a more challenging question] Prove that there is no mixed-strategy Nash equilibrium where Player 1 plays Mwith probability strictly between 0 and 1.
. In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. a. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. b. Is there a pure strategy? Why or why not? c. Determine the optimal strategies and the value of this game. Does the game favor one player over the other? d. Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
Subgames • • • At each node where a player makes a decision, we can think about the "subgame" starting at that node A subgame is the portion of the tree following a particular node How many subgames does our first sequential move example have? • How many subgames does our entry game have? • How many subgames does the game on the right have? • What are its Nash equilibria? Player 1 (1,4) T Player 2 U B (5,2) (3,3) р Player 1 D L 9 (2, 0) Player 2 R (6, 2)
Consider the following extensive form game between player 1 and player 2. T B (2, 2) L R R (3, 1) (0, 0) (5, 0) (0, 1) (a). Find the normal form representation of this game. (show the bimatrix) (b). Find all pure strategy NE. (c). Which of these equilibria are subgame perfect?
What is the Nash Equilibria of the following game? Penalty Game Keеper L R Striker L 1,-1 -1, 1 R -1,1 3, -1 Select one: a. None of the other answers b. (1/2 L+ 1/2 R, 2/3 L+ 1/3 R) c. (1/3 L + 2/3 R, 1/2 L+ 1/2 R) d. (1/2 L+ 1/2 R, 1/2 L+ 1/2 R) e. (1/2 L+ 1/2 R, 1/3 L+ 2/3 R)
learn.canterbury.ac.nz Clasarsom Nov 15-ICO EUC LEARN | AKO See the game below and answer the questions 8 to 11: Player-1 C Player-2 X, Y Y Player-1 9 14 8. Player-2 16 17 16 Nash Equilibrium in this game: Select one: O a. Playert: C; Player2: X O b. Playert: C; Player2: Y Oc. Playert: L; Player2: X Od. Playert: L; Player2: Y e. None
Not Play 1 Play 11 2 1 Trust Distrust 1 Steal Share 0 2 10 0 55 5 5 Find all of the pure strategy Nash Equilibria of this game. There can be more than one equilibrium. [Here ((Not Play, Steal), (Trust)) indicates that player 1 chooses Not Play at the first decision node and Steal at the second decision node, and 2 chooses Trust at his unique decision node.] a) ((Play, Share), (Trust)) b) ((Not play, Share), (Distrust)) c) ((Not play, Steal), (Distrust)) d) ((Not play, Steal), (Trust)) ☐ e) ((Play, Steal), (Distrust))
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 ?
Game theory 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. Player 2 7. Player 1 A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly
Question > Consider the following matrix game where Player 1 moves first then Player 2 observes player 1's move and responds. Draw the game tree for the sequential move game and then determine all the Nash equilibria. Player 1 Strategy A Strategy B Strategy C Strategy D -3, -2 10, 12 9, 20 Player 2 Please show each step on how to get the answer. Thank you! Strategy E 13,7 17, 17 12, 21 Strategy F 20,8 22, 16 19, 19