Is there a way to prove the existence of a Nash equilibrium in finite games without using Kakutani or Brouwer's fixed-point theorems?


There are ways to do so for specific types of games. Some examples:

  • For zero-sum games, you can prove existence using Farka's Lemma.
  • For supermodular games, you can prove existence using Topkis Theorem and the Knaster-Tarski Fixed-Point Theorem.
  • For potential games, you can prove existence using Weierstrass Maximum Theorem.
  • You can show that all compact-continuous games have rationalizable strategies without a fixed-point argument. Also, if a game has a unique rationalizable strategy-profile, it must be a Nash equilibrium.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.