Finding a Nash equilibrium in spatial games is an NP-complete problem
Year of publication: |
2004
|
---|---|
Authors: | Baron, Richard ; Durieu, Jacques ; Haller, Hans ; Solal, Philippe |
Published in: |
Economic Theory. - Springer. - Vol. 23.2004, 2, p. 445-454
|
Publisher: |
Springer |
Subject: | Spatial games | NP-completeness | Graph k-colorability |
-
Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem
Baron, Richard, (2002)
-
Hotelling competition and the gamma distribution
Tarbush, Bassel, (2018)
-
MIGRATION AS A MECHANISM TO PROMOTE COOPERATION
HELBING, DIRK, (2008)
- More ...
-
Good neighbors are hard to find : computational complexity of network formation
Baron, Richard, (2008)
-
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 ...