Baron, Richard; Durieu, Jaçques; Haller, Hans; Solal, … - Økonomisk Institut, Københavns Universitet - 2002
We consider the class of (finite) spatial games. We show that the problem of determining whether there exists a Nash equilibrium in which each player has a payoff of at least k is NP-complete as a function of the number of players. When each player has two strategies and the base game is an...