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 |
-
A bargaining approach to coordination in networks
Meléndez-Jiménez, Miguel A., (2008)
-
Existence of Nash networks in one-way flow models
Billand, Pascal, (2008)
-
Direct networks with global spillovers
Billand, Pascal, (2007)
- More ...
-
Control costs and potential functions for spatial games
Baron, Richard, (2002)
-
Finding a nash equilibrium in spatial games is an NP-complete problem
Baron, Richard, (2003)
-
Complexity and stochastic evolution of dyadic networks
Baron, Richard, (2003)
- More ...