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

We consider a model where policy motivated citizens vote in two simultaneous elections, one for the President who is elected by majority rule, in a single national district, and one for the Congressmen, each of whom is elected by majority rule in a local district. The policy to be implemented...