登入選單
返回Google圖書搜尋
Costly Network Formation and Regular Equilibria
註釋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.