5. Consider a game in which two players, Fred and Barney, take turns removing matchsticks from a pile. They start with 21 matchsticks, and Fred goes first. On each turn, each player may remove either 1, 2, 3, or 4 matchsticks. The player to remove the last matchstick wins the game. 1. Suppose there are only 6 matchsticks left, and it is Barney's turn. What move should Barney make to guarantee himself victory? Explain your reasoning. 2. Suppose there are 12 matchsticks left, and it is Barney's turn. What move should Barney make to guarantee himself victory? (Hint: Use your answer to part (a) and roll back.) 3. Now start from the beginning of the game. If both players play optimally, who will win?

5. Consider a game in which two players, Fred and Barney, take turns removing matchsticks from a pile. They start with 21 matchsticks, and Fred goes first. On each turn, each player may remove either 1, 2, 3, or 4 matchsticks. The player to remove the last matchstick wins the game. 1. Suppose there are only 6 matchsticks left, and it is Barney's turn. What move should Barney make to guarantee himself victory? Explain your reasoning. 2. Suppose there are 12 matchsticks left, and it is Barney's turn. What move should Barney make to guarantee himself victory? (Hint: Use your answer to part (a) and roll back.) 3. Now start from the beginning of the game. If both players play optimally, who will win?

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

4. Consider a two player game with Fred and Barney, who tal turns removing matchsticks from a pile. They start with 33 matchsticks, and Fred goes first. On each turn, ecach player may remove either one, two, three, four, or five matchsticks. The player to remove the last matchstick wins the game. What are the optimal strategies for each player? Who will win? b. Suppose now that they can remove up to six matchsticks, how will the optimal strategies change for- each player? a.
3.Students A and B decide whether to clean the dormitory. Regardless of whether the other party participates, the cleaning cost for each student to clean the dormitory is $ 8; and the benefit for each student from cleaning is $5 times the number of participants. (hint: if both of them clean the dormitory together, A and B benefit. If one cleans while the other does not, A and B benefit too) (a) Please use a game theory to briefly describe the above scenario, (that is to calculate the revenue for different strategies) (b) Draw the payoff matrix, find the Nash equilibrium.
Use the following game table to answer the question: Player 2 Y A 10, 5 6, 3 0,0 Player 1 B 2,6 1, 3 0,0 3,5 3, 4 3, 3 One of these players has a strictly dominant strategy. Which player, and what strategy is it? Player 2; Y Player 1; A Player 2; X O Player 1; B O Player 1; X
Table 8. This table shows a game played between two players, A and B. The payoffs are given in the table as (Payoff to A, Payoff to B). A Select one: Up Middle Down Left (4,2) a. Middle-Center O b. Down-Center (3, 1) (1,3) B Center (2,5) (5, 3) (4,4) Refer to Table 8. This table shows a game played between two players, A and B. The payoffs in the table are shown as (Payoff to A, Payoff to B). Which of the following outcomes represents a Nash equilibrium in the game? Right (3, 3) (5,2) (6, 1) O c. Up-Left O d. More than one of the above is a Nash equilibrium in this game.
GAME 5 Player B B1 B2 Player A A1 7,3 | 5, 10 A2 3, 8| 9, 6 In Game 5 above, O Neither player has a dominant strategy. O Player B has a dominant strategy. O Player A has a dominant strategy. O Both players have dominant strategies.
2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. TTTT Player 1 Player 2 Player 1 Player 2 (3, 3) t (1, 1) (0, 3) (2, 2) (1, 4) (a) List all possible strategies of each player. (b) Transform the game tree into a normal-form matrix representation. (c) Find all pure-strategy Nash equilibria. (d) Find the unique pure-strategy subgame-perfect equilibrium.
2
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
7
Image attched
11. The following payoff table involves two players each of whom has three possible moves. L M N L 30,15 45,35 55,25 M 25,35 20,20 30,50 N 15,35 35,40 15,15 a. Are there any dominant strategies in this game?
3. Suppose we play the following game. I give you $100 for your initial bankroll. At each time n, you decide how much of your current wealth to bet. You cannot borrow money. You can only play with the money I gave you in the beginning or any money that you have won so far. The game is simple. At each time n ≥ 1, you decide the amount to bet. I will roll a fair die. If the die comes up 1,2,3,..., or 5, you win; if the die comes up 6, then you lose. IOW, if you bet $10 on the first roll, you will either have $90 or $110 after the first roll. (a) Suppose you wish to maximize your profit on the first roll. How much should you bet? (Most of you will get this wrong.) (b) What is the expected profit on the first roll if your bet is b with 0 ≤ b ≤ 100? (c) Suppose you wish to maximize your expected profit on the first roll. How much should you bet? (d) Suppose you wish to maximize your expected profit betting on the nth roll. How much of your current wealth do you bet? (e) Let X₂, be your…