Please show your work. Where there are explanations, justify your answer. 1. Consider a game with two players, player 1 and player 2. Player 1 has the possible actions: A and B. Player 2 has the possible actions: C and D. a. If this is a static game, give an example strategy for player 1 and an example strategy for player 2. b. Now assume this is a sequential game with player 1 going first and player 2 moving second (and then the game ends). Give an example of a strategy for player 1 and an example for player 2. c. Now assume this is a repeated game (so, the stage game is the same as (a.)). The game is played twice. Give an example of a strategy for player 1 and an example of a strategy for player 2

Please show your work. Where there are explanations, justify your answer. 1. Consider a game with two players, player 1 and player 2. Player 1 has the possible actions: A and B. Player 2 has the possible actions: C and D. a. If this is a static game, give an example strategy for player 1 and an example strategy for player 2. b. Now assume this is a sequential game with player 1 going first and player 2 moving second (and then the game ends). Give an example of a strategy for player 1 and an example for player 2. c. Now assume this is a repeated game (so, the stage game is the same as (a.)). The game is played twice. Give an example of a strategy for player 1 and an example of a strategy for player 2

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.3P

See similar textbooks

Similar questions

i. ii. QUESTION ONE A. A Nash equilibrium is a strategy profile such that every player's strategy is the best response to all the other players. It requires that each player makes a best response and that expectations regarding the play of other players are correct. Below is the table showing strategies and payoff for Player 1 and Player 2. PLAYER 1 R1 R2 R3 R4 C1 0,7 5,2 7,0 6,6 C2 2,5 3,3 2,5 2,2 PLAYER 2 C3 7,0 5,2 0,7 4,4 CA 6,6 2,2 4,4 10,4 REQUIRED; Transform the normal form game above into an imperfect extensive game form Find the Nash equilibrium for the game above using iterative deletion of strictly dominated strategies. Find the Nash equilibrium using brute force or cell by cell inspection.
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? 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. с.
1) Suppose that Player A can take two actions, either Up or Down. Player A is thinking to choose Up 50 percent of the time, and Down 50 percent of the time. This type of strategy is called a ____ ? 2) Consider a payoff matrix of a game shown below. In each cell, the number on the left is a payoff for Player A and the number on the right is a payoff for Player B. In order for (Down, Right) to be a unique pure strategy Nash equilibrium, a must be (greater, or smaller) than 3 and b must be (greater, or smaller) than 3. refer to image
2. Consider two players playing a simultaneous moves game. These players can be one of the two states of the world, state 1 or state 2, while playing the game. The payoffs-matrix for the two state games are as follows: State 1 P1 U D P2 L R 1,4 1,0 1,6 2,16 0,0 0,24 M State 2 P1 U D P2 L M R 1,0 1,4 1,6 2,16 0,24 0,0 Each players believes that the two states are equally likely, Derive the BNE of the game.
The following payoff matrix represents a simultaneous-move game between two players: Kay and Jack. Each player has two choices: Black or White. The first number in each cell is the payoff to Kay, and the second number is the payoff to Jack. Jay Black White 50, 30, Black 50 30 Кay 45, 40, White 30 50 Refer to the scenario above. Which is true? a. This game has a dominant strategy equilibrium. b. This game has two dominant strategy equilibria. c. This game has two Nash equilibria. d. This game has one Nash equilibrium.
. 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.
Sam and Sarah are thinking about getting married. However if either of them cheats on the other, they would get a payoff of 10, while the other person gets zero. If neither cheat, they stay with each other and get a payoff of 7 each and if both cheat, the relationship falls apart and each get a payoff of 1. What is the Nash equilibrium of this game? a. Cheat, Cheat b. Not cheat, Not cheat Sam cheats, Sarah doesn't Sarah cheats, Sam doesn't
Use the following payoff matrix for a one-shot game to answer the accompanying questions. a. Determine the Nash equilibrium outcomes that arise if the players make decisions independently, simultaneously, and without any communication. Which of these outcomes would you consider most likely? Explain. b. Suppose player 1 is permitted to “communicate” by uttering one syllable before the players simultaneously and independently make their decisions. What should player 1 utter, and what outcome do you think would occur as a result? c. Suppose player 2 can choose its strategy before player 1, that player 1 observes player 2’s choice before making her decision, and that this move structure is known by both players. What outcome would you expect? Explain.
a. Consider the following sequential game. Player 1 A B Player 2 Player 1 a a B Player 2 (4) () y i. Determine the subgame perfect Nash equilibria and their outcomes. ii. Determine the Nash equilibria of the game. For each of the Nash equilibria, argue why no player has a profitable deviation. ii. Determine which parts of the Nash equilibrium strategies involve uncredible threats.
H2. One day, Sam and Ryan play odds/evens to see who gets the last doughnut. On command, they each extend one or two fingers. If the sum is odd Sam wins the doughnut, if the sum is even Ryan wins the doughnut. Suppose the payoff from winning the doughnut is 1 and the payoff from losing is 0. a) Illustrate this interaction as a game in matrix form. b) Suppose that Sam thinks that Ryan will play one finger for sure? What will Sam play? Does Sam have reason to think that Ryan will play one finger for sure? c) Do either of them have a strictly dominated strategy? d) Find the pure strategy Nash equilibria of the game, if any. e) Suppose that Sam thinks that Ryan will play one finger or two fingers with even odds. Will Ryan play one finger for sure, play two fingers for sure or play each strategy with even odds? Does Sam have good reason to believe that Ryan will play one finger or two fingers with even odds?
6 Two people will select a policy that affects both of them by applying a "veto" in a sequential and alternate manner, that is: person 1 begins to veto a policy and then person 2 exercises his "veto" with the remaining policies; the process repeats until only one policy remains. Assume that there are 3 policies: X,Y,Z, and that person 1 prefers X to Y to Z and person 2 prefers Z to Y to X. a. Represents the game extensively b. Give the number of subgames C. Indicate the total strategies of the players d. find all subgame perfect nash equilibria e. Find all Nash Equilibriums.
1. Consider a game of chicken: two players approach a narrow bridge with room only for one, and each chooses either to go through and hope the other guy backs off (call this action H, for "hawk"), or backs off to let the other go through (call this action D, for "dove"). If both players are normal, then each gets a payoff of -1 from a collision (i.e. if both choose H), 1 if they choose H against D, 0 if they choose D (regardless of what the other player chooses). Now perturb the game as follows: there is a chance p > 0 that P2 is a “violent type", who gets 1 from playing H regardless of Pl's action, and -1 from playing D, again regardless of P1's action. (a) Illustrate the game tree corresponding to the Harsanyi transformation of this game (i.e. the dynamic game of imperfect information in which nature moves first). (b) Illustrate the extended game (i.e. the normal form game corresponding to your game tree in part (a)). (c) Find all values of p for which there is a BNE in which P1…