Consider a sequential game where there are two players, Jake and Sydney. Jake really likes Sydney and is hoping to run in to her at a party this weekend. Sydney can't stand Jake. There are two parties going on this weekend and each player's payoffs are a function of whether they see one another at the party. The payoff matrix is as follows: Sydney Party 1 Party 2 Party 1 6, 18 18,6 Jake Party 2 24,8 0,24 a) Does this game have a pure strategy Nash Equilibrium? b) What is the mixed strategy Nash Equilibrium? c) Now suppose Sydney decides what party she is going to first. Her roommate is friends with Jake and will call him to tell him which party they go to. Write the extensive form of this game (game tree). d) What is the subgame perfect Nash equilibrium from part c?

Consider a sequential game where there are two players, Jake and Sydney. Jake really likes Sydney and is hoping to run in to her at a party this weekend. Sydney can't stand Jake. There are two parties going on this weekend and each player's payoffs are a function of whether they see one another at the party. The payoff matrix is as follows: Sydney Party 1 Party 2 Party 1 6, 18 18,6 Jake Party 2 24,8 0,24 a) Does this game have a pure strategy Nash Equilibrium? b) What is the mixed strategy Nash Equilibrium? c) Now suppose Sydney decides what party she is going to first. Her roommate is friends with Jake and will call him to tell him which party they go to. Write the extensive form of this game (game tree). d) What is the subgame perfect Nash equilibrium from part c?

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.3P

See similar textbooks

Similar questions

Consider the following two-player game.First, player 1 selects a number x≥0. Player 2 observes x. Then, simultaneously andindependently, player 1 selects a number y1 and player 2 selects a number y2, at which pointthe game ends.Player 1’s payoff is: u1(x; y1) = −3y21 + 6y1y2 −13x2 + 8xPlayer 2’s payoff is: u2(y2) = 6y1y2 −6y22 + 12xy2Draw the game tree of this game and identify its Subgame Perfect Nash Equilibrium.
Consider the following game : Stag Rabbit Stag 9, 9 0, 8 Rabbit 8, 0 7, 7 The first payoff is that of player 1 and the second that of player 2. a. ) Draw the extensive form of the simultaneous game. Find all the Nash equilibrium. p. Suppose player 1 moves first or we are in a sequential game now. Draw the extensive form in the sequential version. c. What is the subgame perfect Nash Equilibrium (SPNE) in the sequential version? d. ) Explain why it is an SPNE.
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?
The game of Chicken is played by two teens who speed toward each other on a single-lane road. The first to veer off is branded the chicken, whereas the one who does not veer gains peer-group esteem. Of course, if neither veers, both die in the resulting crash. Payoffs to the Chicken game are provided in the following table. Team 2 Veer Does not veer Team 1 Veer 2, 2 1, 3 Does not veer 3, 1 0, 0 The first payoff number is for Teen 1 and the second number is for Teen 2. a) Does any of the players has a dominant strategy? b) Find the pure-strategy Nash equilibrium or equilibria. c) Suppose the game is played sequentially. Find the Nash equilibrium.
Consider the following game represented in normal form. Terry and Kerry are roommates who must make decisions about cleaning. Terry's payoff is the fiırst number in each cell and a higher number is a better outcome. Assume that Terry and Kerry make their decisions simultaneously. Kerry Clean Don't clean Terry Clean ( 8, 2 ) ( 3, 5 ) Don't ( 10, 3) ( 4, 1 ) clean The Nash equilibrium of this game is Terry will [ Select ] v and Kerry will [ [ Select ]
Keith and Blake play a simultaneous one-shot game given by the following table: Blake Left Right Keith Top Bottom 4.00, -5.00 0.00, -6.00 5.00, 0.00 -2.00, 7.00 As there is no unique pure strategy Nash equilibrium, assume that each player plays each of his choices half of the time. What is the average payoff for Keith? | What is the average payoff for Blake? (Round to two decimals if necessary.) (Round to two decimals if necessary.)
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. с.
Consider the following centipede game consisting of two players, Pl and P2. The left/right number each terminal node represents Pl's/P2's payoff, respectively. Then, answer the following questions of [D5] and [M5]-|M8]: P1 G P2 P1 G -(0, 2) D (2, 0) (1, 1) (4, 0) Suppose that P2 chooses G or D randomly. Then, what is the Pl's best response of P1 for the P2's choice? And explain why. We assume that random choice is level-0 in the level-k theory. Then, answer the P2's choice in level-2. (a) D (b) G (c) random choice on (G, D) (d) G with probability 1/3 Answer all the properties of Nash equilibrium and subgame perfect equilibrium which is derives from the backward induction. (a) All subgame perfect equilibria are Nash equilibria in any game. (b) All Nash equilibria are subgame perfect equilibria in any game. (c) There is always a unique Nash equilibrium in any game. (d) There exist pure-strategy Nash equilibria in any game. (e) The Nash equilibrium in prisoners' dilemma game is socially…
Return to the game between Monica and Nancy in Exercise U10 in Chapter 5. Assume that Monica and Nancy choose their effort levels sequentially instead of simultaneously. Monica commits to her choice of effort level first. On observing this decision, Nancy commits to her own effort level. What is the subgame - perfect equilibrium of the game where the joint profits are 5m + 4n+ mn, the costs of their efforts to Monica and Nancy are m2 and n2, respectively, and Monica commits to an effort level first? Compare the payoffs to Monica and Nancy with those found in Exercise U10 in Chapter 5. Does this game have a first-mover or second - mover advantage? Using the same joint profit function as in part (a), find the subgame - perfect equilibrium for the game where Nancy must commit first to an effort level. U10. Return to the game between Monica and Nancy in Exercise U10 in Chapter 5. Assume that Monica and Nancy choose their effort levels sequentially instead of simultaneously. Monica commits…
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
. Find the Nash equilibrium of the following modified Rock-Paper-Scissors game: • When rock (R) beats scissors (S), the winner’s payoff is 10 and the loser’s payoff is −10. • When paper (P) beats rock, the winner’s payoff is 5 and the loser’s payoff is −5. • When scissors beats paper, the winner’s payoff is 2 and the loser’s payoff is −2. • In case of ties, both players receive 0 payoff. You are suposed to create a system of equations and then solve for them and find 3 probabilities- please show how to do that
please discuss the separation eqilibrium in details 1. Assume that two players play the Tinder game. There are two types of potential boyfriends: the gentleman (25% of the population) and the douchebag (75% of the population), and they can decide on the different level of effort: low, medium, and high. For the first type, the respective costs are 30, 50, and 80. For the second type, the respective costs are 50, 75, and 120. For the potential boyfriend, the payoff from being in relationship is 130, and the payoff associated with being dumped is 70. The girl can get 60 if she stays single, 100 if she is in relationship with the gentleman, and 25 if she dates the douchebag (credits to Owen Sims) a) Present the game in the extensive form b) Calculate the expected pay-off for the girl. Should she date at all? c) Discuss whether the game has a separating equilibrium