The Ubiquity of Connectedness in Large Generic Games with Pure Nash Equilibria

While simple adaptive dynamics are not guaranteed to converge to a pure Nash equilibrium in every game, this paper demonstrates that such convergence is almost guaranteed in large generic games due to the prevalence of connectedness in their best-response graphs.