Question

In a two-player game, player 1 can choose either U or D as strategies. Player 2 can choose either L or R as strategies. Let 𝑐 be a real number such that $0 < 𝑐 < 1$. If the payoff matrix is	L	R
U	0, 0	0, −c
D	−c, 0	1 − c, 1 − c
then the number of pure strategy Nash Equilibria in the game equals

• A. 1
• B. 2
• C. 3
• D. 4

Answer 1

Answer: (B)

2

Answer 2

The correct answer is (B): 2