i need the answer quickly The game tree below illustrates the payoffs for two runners who can either run in a marathon or stay home.What is the equilibrium in this sequential-move game?(15,5)RunRunner 2RunStay Home(20,10)(8,18)RunRunnerlStay HomeRunner 2Stay Home(2,2)Runner 1 will run, and Runner 2 will stay home.Both runners will run.Runner 1 will stay home, and Runner 2 will run.Both runners will stay home.

The sequential game involves multiple players in the game who do not make decisions simultaneously…

The game tree below illustrates the payoffs for two runners who can either run in a marathon or stay home. What is the equilibrium in this sequential-move game? Runner 2 (15,5) Run Run Stay Home (20,10) (8,18) Run Runnerl Stay Home Runner 2 Stay Home (2,2) Runner 1 will run, and Runner 2 will stay home. Both runners will run. Runner 1 will stay home, and Runner 2 will run. Both runners will stay home.

The game tree below illustrates the payoffs for two runners who can either run in a marathon or stay home. What is the equilibrium in this sequential-move game? Runner 2 (15,5) Run Run Stay Home (20,10) (8,18) Run Runnerl Stay Home Runner 2 Stay Home (2,2) Runner 1 will run, and Runner 2 will stay home. Both runners will run. Runner 1 will stay home, and Runner 2 will run. Both runners will stay home.

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

Player 1 Cooperate (C) Defect (D) If the game has a dominant strategy, what is it? There is none. If the game has a Nash equilibrium in pure strategies, what is it? There is none. Cooperate (C) 3,3 8,0 Cooperate (C) is a dominant strategy for both players. Defect (D) is a dominant strategy for both players. Cooperate (C) is a dominant strategy for 1, and Defect (D) is a dominant strategy for 2. C, C is the only Nash equilibrium. D, D is the only Nash equilibrium. C, C and D, D are both Nash equilibria. Player 2 Defect (D) 0,8 1,1
1. A row of minus signs is written on a whiteboard (can be any number). Two players take turns in replacing either a single minus sign by a plus sign or two adjacent minus signs by two plus signs. The player who makes the last move wins. Discuss the possible strategy for the first mover to force a win.
Consider the following game. Firm 1 can implement one of two actions, A or B. Firm 2 observes the action chosen by Firm 1 and then decides whether to fight it or not. (-10, 20) F2 Fight A Don't fight -(30, 10) Firm 1 (-10, 0) Fight B Don't fight -(20, 15) (a) Consider the following strategy profile: Firm 1 chooses A; Firm 2 chooses fight if A, and fight if B. • this strategy profile is [Select] (b) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses fight if A, and don't fight if B. • this strategy profile is [Select] O (c) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses don't fight if A and don't fight if B. • this strategy profile is [Select] 00 F2 ()
Let G₁, G₂ and G3 be the following games. Colin A Rose B A (10,3) (7,5) B (6,6) (8.4) G₁ Rose Rose Colin A B A (4,4) (3,6) B (5,3) (2,7) G3 Colin A B A (5,8) (4,2) B (9,2) (3,5) G₂ Rose and Colin play the following dynamic game with Rose moving first. In her first move, Rose has a choice of either 0 or 3. If she chooses 3, then Rose and Colin play G3 with Colin moving first. If Rose chooses 0 in her first move, then Colin can play either 1 or 2 in his first move. If he plays 1, then Rose and Colin play G₁ with Rose moving first, and if he plays 2, then Rose and Colin play G₂ with Rose moving first. Draw the game tree associated with this game, and find the backwards induction solution.
Game Theory Question A non-profit firm is on a local community online donation platform for a community event it wants to hold (only community members can donate via the website). The event will be held only if the non-profit firm collects $20,000 total from members of the community. Each member values the event at $500. Suppose that there are 100 community members. Community members can only donate by purchasing a lottery ticket from the firm. Each ticket costs $200 and only one ticket can be purchased per member. The proceeds will be collected by the firm. The lottery winner gets a premier meal at a local restaurant that's worth $100. Remember, the firm keeps all the donated money. If the amount of donations is less than $20,000, then the firm returns the donated money to the community members (since there'll be no event held but the lottery winner still gets to eat that fancy meal). If the donations sum up to $20,000, the community event will take place. What are the Nash…
(d) Consider a simultaneous-move game between two firms choosing to sell their product at either £6, £7 or £8. The actions and payoffs are given in the matrix below. Firm 2's Prices £6 £7 £8 Firm 1's prices £6 4, 5 3, 5 2, 1 £7 0,4 2, 1 3,0 £8 -1, 1 4, 3 0, 2 What are the Nash equilibria of this game? Game theory is often used by firms competing under an oligopoly as a means of determining their best strategy. Why is game theory a useful tool and which characteristics of an oligopoly make it particularly useful for firms competing in this market structure? One outcome of an oligopoly is that firms may have an incentive to collude. Explain some of the conditions that make collusion more likely to occur and how game theory can explain why collusive agreements often break down.
14. You have baked a cake, but your two dear daughters won't stop fighting on who gets the biggest slice. To settle the dispute, to ask your dear daughter one (DD1) to cut the cake and your dear daughter two (DD2) to choose which piece she wants. (a) Draw the extensive form of the game. Let dear daughter one's strategies be "Cut Evenly" or "Cut Unevenly"; depending on what is on the platter, dear daughter two's strategies might in- clude "Take Big Slice", "Take Small Slice", or "Take Equal Slice". Assign payoffs to dear daughter one and dear daughter two that grow with the size of the slice that they receive. (b) Use backward induction to find the equilibrium outcome of this game. (c) Is the promise to take a small slice by DD2, if DD1 cuts unevenly, credible? Explain carefully. (d) After the rules are announced, dear daughter two says "It is not fair! I want to be the one who gets to cut the cake, not the one who chooses the slice!". Is dear daughter two's complaint valid? You are…
Player 2 Strategy A Strategy B Strategy 1 (1,4) (2,3) Player 1 Strategy 2 (6,5) (5,4) Consider the game depicted in the table above. The payout for player 1 is given first in parenthesis, with Player 2's payout second. Does either player have a dominant strategy? Player one has a dominant strategy. Player two has a dominant strategy. Both players have a dominant strategy. Neither player has a dominant strategy.
8) Find the mixed strategy Nash equilibrium of the following normal form game. Player 2 T1 T2 T3 2, 3 3, 5 1, 1 Player 1 S2 1, 4 4, 3 0, 5 Player 1 attaches probability (S1, S2) = () and Player 2 attaches probability (T1, T2, T3) = ( ) Player 1 attaches probability (S1, S2) = (.) and Player 2 attaches probability (T1, T2, T3) = (qi, 42, 1 – q1 – 92) where q1 , and 0 < q2 S %3D Player 1 attaches probability (S1, S2) = (G,;) and Player 2 attaches probability (T1, T2, T1) = (qı.42, 1 – q1 – 42) where 0 < qi <, and q2 = 3. Player 1 attaches probability (S1, S) = (;, -) and player 2 attaches probability (T1, T2, T3) = (1.42, 1- q1- 42) where 0 s qı s and q2 =
(Demand Game) Two players can divide ten dollars. Find the Nash equilibria of the following two games. (a) The players simultaneously submit demands, numbers in {0, 1, ... ,10}. If the sum of the demands is at most 10, each player gets what she demands. Otherwise both get 0. (b) As in the previous part, except that if the sum of the demands exceeds 10, then (i) if the demands differ then the player who demands less gets her demand and the other player gets the rest, and (ii) if the demands are the same then each player gets 5. (Hint- write the best response functions).
Refer to Table Left-Right-ZigZag. How many pure strategy Nash equilibria does this game have? Table: Left-Right-ZigZag Player 1 Drive left Driver right Zigzag 1) 1 2) 2 3) 3 4) 4 5) None of the above. Drive left (1,1) (-1,-1) (0,0) Player 2 Driver right (-1,-1) (1,1) (0,0) Zigzag (0,0) (0,0) (0,0)
Which is the correct mixed strategy Nash equilibrium for the below game? A B Confess Confess (3,2) Doesn't (0,0) confess a. (2/5); (3/5) b. (1/4); (3/4) c. (1/2); (1/2) d. (1/3); (2/3) Doesn't confess (0,0) (2,3)