Costly Network Formation and Regular Equilibria

Abstract

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.Network-formation games; Regular equilibrium; Stable sets