Abstract

We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist; such decision problems are well-known to be $\cal NP$-complete [2, 6, 10] . We show that this complexity remains unchanged when all utilities are restricted to be 0 or 1; thus, win-lose games are as complex as general games with respect to such decision problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call