On the computability of Nash equilibria
โ
Kislaya Prasad
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 763 KB
We present some algorithmic unsolvability and incompleteness results in game theory and discuss their significance. The main theorem presents a class of n-person games, where each player's strategy set is the real line and payoffs are continuous functions, for which there could not possibly exist a