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?

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

Consider the three-player game shown. Player 1 selects a row, either a1, b1 or c1. Player 2 selects a column, either a2 or b2. Player 3 selects a matrix, either a3 or b3. The first number in a cell is player 1’s payoff, the second number is player 2’s payoff, and the last number is player 3’s payoff. Derive the strategies that survive the IDSDS.
Use the following payoff matrix for a simultaneous-move one-shot game to answer the accompanying questions. Player 2 Strategy C D E F Player 1 A 26, 19 7, 16 12, 5 19, 10 B 9, 18 16, 2 4, 14 20, 15 a. What is player 1’s optimal strategy? a)Player 1 does not have an optimal strategy. b)Strategy A. c)Strategy B. b. Determine player 1’s equilibrium payoff. Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
Up Down Player 1 in the game above, what is/are the sub-game perfect Nash equilibrium? (up,up) (up,down) (down, up) (down, down) No equilibrium exists Up Down Up Down Player 2 P1 gets $100 P2 gets $100 P1 gets $10 P2 gets $10 P1 gets $15 P2 gets $5 P1 gets $110 P2 gets $10
A small community has 10 people, each of whom has a wealth of $3,000. Each individual must choose whether to contribute $300 or $0 to the support of public entertainment for their community. The money value of the benefit that a person gets from this public entertainment is one half of the total amount of money contributed by all individuals in the community. This game has a Nash equilibrium in which 5 people contribute $300 and for public entertainment and 5 people contribute nothing. This game has a dominant strategy equilibrium in which nobody contributes anything for public entertainment. This game has no Nash equilibrium in pure strategies, but has a Nash equilibrium in mixed strategies. This game has a dominant strategy equilibrium in which all 10 citizens contribute $300 to support public entertainment. This game has two Nash equilibria, one in which everybody contributes $300 and one in which no- body contributes $300.
Find all ESS, if any, in the following symmetric game. Please check all that apply: Stop OMixed 1/4 Go and 3/4 Stop OMixed 1/2 Go and 1/2 Stop OMixed 2/3 go and 1/3 Stop Go There are no ESS Go Stop Go 2.2 5,3 Stop 3,5 2,2
Up ооооо Down Player 1 Up No EFFICIENT equilibrium exists Down Up Down Player 2 P1 gets $120 P2 gets $5 P1 gets $100 P2 gets $10 P1 gets $95 P2 gets $95 In the game above, what is/are the EFFICIENT sub-game perfect Nash equilibrium? (up,up) (up,down) (down, up) (down, down) P1 gets $15 P2 gets $25
A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?
Consider the following game: Payoff Matrix Player B L M R U 10, 11 8, 13 7, 12 Player A C 14, 12 9,9 5, 7 D 12, 5 10, 6 8,8 Select the Nash equilibrium/equilibria of this game
Consider the game in the table below. What is firm A's payoff from their best response to Firm B choosing Down? Firm A Left Straight Right Up 7,5 3,7 1,3 Firm B Middle 8,14 2,7 4,17 Down 9,13 1,3 2,16 16
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
Consider the following sequential move game of imperfect information. Consider the following sequential move game of imperfect information. In the event that Otis chooses Down, then they play the simultaneous move game shown in normal form (where Otis chooses between X and Y and Maeve simultaneously chooses between W and V). A (25,6) Maeve Up B (5,10) (12,5) Otis Middle Maeve Down w Otis (0, 0) (10, 10) Y (15, 15) (0, 0) Find all (pure strategy) subgame perfect Nash equilibria.
Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7