How many rationalizable strategies does Player 1 have?
Q1.
| Player 2 | |||||
| e | f | g | h | ||
| a | 0,0 | 3,5 | 1,6 | -3,3 | |
| Player 1 | b | x,y | 0,7 | 4,y | 10,5 |
| c | x,3 | 4,0 | 2,1 | -4,-2 | |
| d | -2,4 | 0,5 | 0,7 | -7,3 |
a) Suppose x = -2 and y = 9. How many rationalizable strategies does Player 1 have?
b) Suppose x = -2 and y = 9. How many rationalizable strategies does Player 2 have?
c) Suppose x = -2 and y = 9. What is the sum of both players’ payoffs in all pure strategy Nash equilibria of the game?
d) Suppose x = 3 and y = 9. How many rationalizable strategies does Player 1 have?
e) Suppose x = 3 and y = 9. How many rationalizable strategies does Player 2 have?
f) Suppose x = 3 and y = 9. What is the sum of both players’ payoffs in all pure strategy Nash equilibria of the game?
