| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5072428 | Games and Economic Behavior | 2010 | 6 Pages |
Abstract
We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.
Keywords
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Francesco De Sinopoli, Carlos Pimienta,