Showing 1 - 2 of 2
Persistent link: https://www.econbiz.de/10008537634
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. Copyright Springer-Verlag Berlin/Heidelberg 2004
Persistent link: https://www.econbiz.de/10005597847