Affordable Access

Undecidability of the existence of pure Nash equilibria

  • Computer Science


The purpose of this paper is to show that for any positive integer n, there exists no algorithm which decides for each non-cooperative n-person game in strategic form with partially computable payoff functions whether it has a pure Nash equilibrium or not. Copyright Springer-Verlag Berlin/Heidelberg 2004

There are no comments yet on this publication. Be the first to share your thoughts.