OurBigBook About$ Donate
 Sign in Sign up

Brouwer proof of Nash equilibrium for a two-by-two game

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Game theory Bimatrix game Nash equilibrium
Created 2026-09-24 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
Normalize each player's positive pure-strategy payoff improvements to define a continuous self-map of the product of their mixed-strategy simplices. At a Brouwer fixed point every positive improvement must vanish, giving a Nash equilibrium.

 Ancestors (7)

  1. Nash equilibrium
  2. Bimatrix game
  3. Game theory
  4. Mathematical optimization
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 4 / 12G / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook