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. - Springer. - Vol. 12.2008, 1, p. 1-19
|
Publisher: |
Springer |
Subject: | Strategic games | Network formation | Computational complexity |
-
Haller, Hans, (2010)
-
The γ-Core and Coalition Formation
Chander, Parkash, (2003)
-
Ambiguity and Social Interaction
Eichberger, Jürgen, (2007)
- 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)
-
Finding a nash equilibrium in spatial games is an NP-complete problem
Baron, Richard, (2003)
- More ...