We prove that for generic network-formation games where players incur some strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.

In Poisson games, an extension of perfect equilibrium based on perturbations of the strategy space does not guarantee that players use admissible actions. This observation suggests that such a class of perturbations is not the correct one. We characterize the right space of perturbations to...

We prove that for generic plurality games with positive cost of voting, the number of Nash equilibria is finite. Furthermore all the equilibria are regular, hence stable sets as singletons. Copyright Springer-Verlag Berlin/Heidelberg 2005