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.(adsbygoogle = window.adsbygoogle || []).push({});

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

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Nash's Theorem proof in 2by2 games

Loading...

Similar Threads - Nash's Theorem proof | Date |
---|---|

A Cubic quartets? | Feb 15, 2018 |

B Fermat's Last Theorem; unacceptable proof, why? | Feb 15, 2018 |

Nash Equilibrium and IESDS | Aug 8, 2015 |

References for Nash's game theory | Sep 3, 2012 |

Game Theory - Nash Equilibrium | Dec 20, 2003 |

**Physics Forums - The Fusion of Science and Community**