We apply stochastic stability to undiscounted finitely repeated two player games without common interests. We prove an Evolutionary Feasibility Theorem as an analog to the Folk Theorem (Benoit and Krishna, 1985 and 1987). Specifically, we demonstrate that as repetitions go to infinity, the set of stochastically stable equilibrium payoffs converges to the set of individually rational and feasible payoffs. This derivation requires stronger assumptions than the Nash Folk Theorem (Benoit and Krishna, 1987). It is demonstrated that the stochastically stable equilibria are stable as a set, but unstable as individual equilibria. Consequently, the Evolutionary Feasibility Theorem makes no prediction more specific than the entire individually rational and feasible set.