Good neighbors are hard to find : computational complexity of network formation
Year of publication: |
2008
|
---|---|
Authors: | Baron, Richard ; Durieu, Jacques ; Haller, Hans ; Savani, Rahul ; Solal, Philippe |
Published in: |
Review of economic design : RED. - Berlin : Springer, ISSN 1434-4742, ZDB-ID 1409550-6. - Vol. 12.2008, 1, p. 1-19
|
Subject: | Nichtkooperatives Spiel | Noncooperative game | Nash-Gleichgewicht | Nash equilibrium | Netzwerk | Network | Computerunterstützung | Computerized method | Theorie | Theory |
-
Costly network formation and regular equilibria
De Sinopoli, Francesco, (2010)
-
A note on the existence of Nash networks in one-way flow models
Derks, Jean J. M., (2009)
-
Networks as public infrastructure : externalities, efficiency, and implementation
Haller, Hans, (2013)
- More ...
-
Good neighbors are hard to find: computational complexity of network formation
Baron, Richard, (2008)
-
Good neighbors are hard to find: computational complexity of network formation
Baron, Richard, (2007)
-
Control costs and potential functions for spatial games
Baron, Richard, (2003)
- More ...