3 The payoff functions for Curly and Shemp are, respectively, c(x, y) = xy² = x², s(x, y) = 8y = xy2, with x = [1, 3], y = [1, 3]. Curly chooses x and Shemp chooses-y. (a) Find and graph the rational reaction sets for each player. Recall that the best response for Curly is BR. (y) E arg max c(x, y) and the rational reaction set for Curly is the graph of BR, (y). Similarly for Shemp. (b) Find a pure Nash equilibrium.

3 The payoff functions for Curly and Shemp are, respectively, c(x, y) = xy² = x², s(x, y) = 8y = xy2, with x = [1, 3], y = [1, 3]. Curly chooses x and Shemp chooses-y. (a) Find and graph the rational reaction sets for each player. Recall that the best response for Curly is BR. (y) E arg max c(x, y) and the rational reaction set for Curly is the graph of BR, (y). Similarly for Shemp. (b) Find a pure Nash equilibrium.

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

Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors rock 0. -3 1 1. раper scissors -1 -1 3 (a) Show that xT= (,) and yT= (5) together are not a Nash equilibrium 3'31 for this modified 3'3 game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
Two workers are on a production line. They each have two actions: exert effort, E, or shirk, S. Effort costs a worker e > 0 and shirking costs them nothing. If two workers do action E a lot of output is produced and the workers earn £3 each. If only one worker chooses action E less output is produced and they both earn £1. The workers earn nothing if they both shirk. (i) Describe this situation as a strategic form game (assuming the workers do not observe each other's effort choice when making their own decision). (ii) For what values of e does this game have strictly dominant strategies? (iii) Describe the Nash equilibria of this game for e = 0,1, 2, 3. (iv) The workers now are re-arranged into a production line. First worker 1 moves and then worker 2 moves. Worker 2 can now see worker l's effort level before they choose their effort. Draw this extensive form game. (v) Find the subgame perfect equilibria of the production-line game for c = 1/2 and c = 3/2.
The payoff matrix below shows the payoffs for Firm A and Firm B, each of whom can either "cooperate" or "cheat." The numbers in parentheses are (payoff for A, payoff for B). Firm B Cooperate Cooperate (30, 30) (x, 10) Cheat (10, X) (20, 20) Firm A Chent If x = 40, the Nash equilibrium is. O a. (Firm A: cheat, Firm B: cheat) O b. (Firm A: cooperate, Firm B: cheat) O c. (Firm A: cheat, Firm B: cooperate) O d. (Firm A: cooperate, Firm B: cooperate) O e. There is no Nash equilibrium for this value of x.
rock paper scissors гock 0. -3 1 рарer 1. -1 scissors -1 3 0. (a) Show that xT= ( ) and yT= (3) together are not a Nash equilibrium 3 3 313 for this modified game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
2- Consider the following game. Player 2 Player 1 U 12, 2 | 3, 9 5, 8 4, 2 D (a) Find all the Nash equilibria, pure and mixed. (b) Suppose that the payoff of the column player u:(D, L) is reduced from 8 to 6, but all other payoffs remain the same. Again, find all the pure- and mixed-strategy Nash equilibria. (c) Compare the mixed-strategy equilibria in parts (a) and (b). Did this worsening in one of player 2's payoffs change player 2's equilibrium mixed strategy? Did it change player l's? Give some intuition.
Consider the following two-player game with three options for each player. (Payouts are listed for the row player first, then the column player.) player Y layery 3,3 A 1,5 4,4 6,2 K 8,1 3,7 5,2 0,6 1,1 Find a mixed Nash equilibrium for this game. Solution suggestion: Use two variables per player. If p and are the probabilities of selecting the first two strategies, then 1-p-q is the probability of selecting the third strategy. You will need to solve a system of equations.
Consider a repeated game with the following stage game: Player 1 O O O Cooperate Not Cooperate This game is repeated T-120 times, and t each period both players must choose their actions simultaneously. The players are deciding whether or not to cooperate specifically, whether or not to follow this cooperation strategy: r≤ 3 S|S|AW|N N|H "Each player will play cooperate as long as no one has played Not Cooperate before. If someone has played Not Cooperate before, then each player will play Not Cooperate forever." rs 5 rs Player 2 In this case, cooperation will be possible if the interest rate r is Not Cooperate 5,15 10, 10 None of the above Cooperate 12, 12 15,5
Problem 3. Consider the following game with three firms. First, firms 1 and 2 si- multancously choose quantities q1 and q2 respectively. After observing firm 1 and 2's quantities, firm 3 chooses its quantity q3. There is no production cost and the inverse demand function is p= 12 – (91 +2 + 93). (a) Compute the SPNE of this game. (b) Give an example of Nash equilibrium s* with s = 4 and s, = 6 , that is not subgame perfect. game theory question
Use the mixed method (Nash Equilibrium) to determine the following: What percentage of time should the maximizer play strategy H? 1. H6 17 ! 12 10 18.8% 84.6% O 15.4% 11.8%
Two business partners jointly own a firm and share equally the revenues. They individually and simultaneously decide how much effort to put into the firm. Let s₁ and s2 denote the effort choices of partner 1 and partner 2, respectively. Assume si € [0, 4]. The cost of effort is given by s? for i E {1, 2}. The firm's revenue is given by 4(81 +82 + bs182) where 0 ≤ b ≤ 1. (Note that the parameter 6 reflects the synergies between the effort levels. b> 0 implies that the more one partner works, the more productive the other partner is.) The payoffs for partners 1 and 2 are: u₁ (81, 82) u2 (81, 82) - = 1 [4(81 +82 +68182)] − 8² - 1 [4(81 +82 + bs182)] – $²
6. Two players each pick a positive integer between 1 and 100. If the numbers are identical, noone wins. If the numbers differ by 1, the one with the lower number pays 1 to the opponent. If the difference is at least 2, the one with the higher number pays 2 to the opponent. What is the NE? Hint: Draw a sketch of the game matrix (while you can't consider all 100 strategies, at least consider the lowest 5-6 numbers) and think about dominated strategies.
Consider the following dynamic game: A (2,0) M 2 K (3,1) B 1 (1,4) A R (5,2) 2 K 1 C (3,1) (2,5) (1,0) (a) What is the strategy set for each player? How many strategies does each player have? (b) Find SPNE. (c) Is there a NE in which action C is a part of equilibrium strategy? (d) Give an example of some other NE that is not SPNE.