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 tum, each 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.

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 tum, each 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.

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

Please help with two images Just the answer
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
What is the SPNE of the following game, where Player 1 moves first and can play A or B, and player 2 moves second and can play X or Y? Player 1 A B Player 2 Y 3,1 2, 3 1, 2 1, 2 >
2
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.
Consider the following game tree. The players are P1 and P2. The strategies available to P1 are L, M, R. The strategies available to P2 are A and B. P1 L R M P2 (1,10) A В A B (0,0) (2,1) (0,0) (2,1)
Use the following game table to answer the question: Player 2 Y 6, 3 1, 3 A 10, 5 0,0 Player 1 B 2,6 0,0 3,5 3, 4 3, 3 Is the Nash equilibrium of this game for Player 1 to choose A and Player 2 to choose X? Why or why not? O It is; if Player 2 chose B or C they would get less than 10, and if Player 1 chose Y or Z they would get less than 5. It is not; Player 2 could get 6, instead of 5, if they chose B. O It is; if Player 1 chose B or C they would get less than 10, and if Player 2 chose Y or Z they would get less than 5. It is; if Player 2 chose B or C they would get less than 5, and if Player 1 chose Y or Z they would get less than 10. It is not; Player 1 could get 6, instead of 5, if they chose B.
Which of the following is NOT an example of a coordination game? O deciding whether to grow tomatoes or flowers coordination with customers O deciding whether to use the same technology as others you are connected to interpersonal relationships
2
7
Consider the following simultaneous games. List all pure equilibrium.
John and Jane usually vote against each other’s party in the SSC elections resulting to negating or offsetting their votes. If they vote for their party of choice, each of them gains four units of utility (and lose four units of utility from a vote against their party of choice). However, it costs each of them two units of utility for the hassle of actually voting during the SSC elections. A. Diagram a game in which John and Jane choose whether to vote or not to vote. B. Suppose John and Jane is in agreement not to vote during the election. 1.) Would such an agreement improve utility? Justify your answer. 2.) Would such an agreement be an equilibrium? Justify your answer.