The next 3 questions involve the following game. There are two players, a husband and wife. They can either be selfish (S) or selfless (U) in their marriage. If they choose to be selfish, then there is a negative ʻguilt’ payoff of g. The payoff matrix is below. Figure 1: The Marriage Game Wife S U S 10-g, 10-g 15-g, 2 U 2, 15-g 12, 12 Number left (right) of comma refers to H's (W's) payoff. 40. Suppose that g = 0. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 41. Suppose that g = 5. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 42. Suppose that g = 10. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). Husband

The next 3 questions involve the following game. There are two players, a husband and wife. They can either be selfish (S) or selfless (U) in their marriage. If they choose to be selfish, then there is a negative ʻguilt’ payoff of g. The payoff matrix is below. Figure 1: The Marriage Game Wife S U S 10-g, 10-g 15-g, 2 U 2, 15-g 12, 12 Number left (right) of comma refers to H's (W's) payoff. 40. Suppose that g = 0. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 41. Suppose that g = 5. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 42. Suppose that g = 10. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). Husband

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 following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
6
Finu all ue purt"3truto5J a fair mechanism for allocating cookies? Explain why or why not. U13. (Optional) Construct the payoff matrix for your own two-player game that satisfies the following requirements. First, each player should have three strategies. Second, the game should not have any dominant strat- egies. Third, the game should not be solvable using minimax. Fourth. should have exactly two pure-strategy Nash equilibria. Provide your game matrix, and then demonstrate that all of the above conditions the game are true.
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 9, 8 14, 14 18, 25 12, 19 B 23, 13 10, 18 14, 26 19, 21 a. What is player 1’s optimal strategy? multiple choice Strategy B Strategy A Player 1 does not have an optimal strategy. b. Determine player 1’s equilibrium payoff. Prev
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.
Table 8. This table shows a game played between two players, A and B. The payoffs are given in the table as (Payoff to A, Payoff to B). A Select one: Up Middle Down Left (4,2) a. Middle-Center O b. Down-Center (3, 1) (1,3) B Center (2,5) (5, 3) (4,4) Refer to Table 8. This table shows a game played between two players, A and B. The payoffs in the table are shown as (Payoff to A, Payoff to B). Which of the following outcomes represents a Nash equilibrium in the game? Right (3, 3) (5,2) (6, 1) O c. Up-Left O d. More than one of the above is a Nash equilibrium in this game.
1
Player 1 Cooperate (C) Defect (D) Cooperate (C) 3,3 8,0 Player 2 Defect (D) 0,8 1,1 In general, a combination of strategies is a Nash equilibrium if ... Every player is choosing a best response against the other players' strategies. Every player has a positive payoff. The players maximize the sum of their payoffs. The players choose identical strategies. If the game is repeated, which cooperative actions could benefit both players? O Both players choose C. Player 1 chooses C, Player 2 chooses D. O Player 1 chooses D, Player 2 chooses C. Both players choose D.
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…
Player 2 A B C А 2, 2 6,1 1,1 Player 1 B 1,6 5,5 1,1 1,1 1,1 4,4 Consider the simultaneous move game represented in normal form by this payoff matrix. Suppose that the game is repeated for two periods. Which of the following outcomes could occur in some subgame perfect equilibrium (SPE) of this repeated game? Choose True if you think the outcome can be a SPE, otherwise choose False. (B, B) is played in the first period, (C, C) is played in the second period. (A, A) is played in both periods. (C, C) is played in both periods.
7
M8