Some Results on the Constructive Existence of Equilibrium in Finite Games
Kislaya Prasad · RePEc: Research Papers in Economics · 1996
For finite games in strategic form it is shown that, in a Nash equlibrium, every player uses a strategy which is computable. However, there can exist no algorithm which is guaranteed to find an equilibrium for every instance of a game with computable payoffs. In contrast, an e-equilibrium is always computable (this is what Scarf type algorithms find).