What are two special properties of Nash equilibria in two-player, zero-sum games?
Can we use linear programming to solve three-player games? Briefly explain why.
What makes finding a correlated equilibrium computationally easier than finding a Nash equilibrium in a general-sum, n-player, normal-form game?
What property of PPAD graphs relates to the existence of a mixed Nash equilibrium?
