Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We show that a two-person finite game is solved by the iterated elimination of never best responses (IENBR) if and only if it is best response acyclic and strongly solvable in the sense of Nash (1951). Thus the rationalizable strategies (Bernheim, 1984; Pearce, 1984) are equivalent to the Nash equilibrium strategies in two-person finite games if and only if the two conditions are met. We prove this for both mixed strategy games and pure strategy games.