Nash's Theorem proof in 2by2 games

  • Thread starter Bipolarity
  • Start date
  • #1
775
2
According to Nash's Theorem, every game has at least one Nash Equilibrium, whether that be a pure strategy or a mixed strategy Nash equilibrium. However, I have not been able to find a proof for the theorem.

I am looking for a proof of the theorem in 2by2 games involving simultaneous strategies. Perhaps someone here knows good places where these proofs can be found? I googled but most seem to explain the theorem rather superficially without a rigorous mathematical approach.

Thanks!

BiP
 

Answers and Replies

  • #3
775
2
Yep! The proofs that show up on google generalize it to 'n' players each having many strategies.

I was looking for a short proof on the simple case of 2by2 games with only 2 players. It should proof the existence of at least one Nash equilibrium.

BiP
 

Related Threads on Nash's Theorem proof in 2by2 games

  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
3
Views
5K
  • Last Post
Replies
2
Views
16K
Replies
2
Views
984
  • Last Post
3
Replies
65
Views
10K
Constructive Proofs Proof of Correspondence theorem
Replies
1
Views
313
M
  • Last Post
Replies
14
Views
5K
Replies
4
Views
2K
Top