OurBigBook About$ Donate
 Sign in Sign up

Symmetric Nash gain map (Ti​(x)=1+∑j​[(Px)j​−xTPx]+​xi​+[(Px)i​−xTPx]+​​)

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Game theory Bimatrix game Nash equilibrium Symmetric equilibrium
2026-10-07  0 By others on same topic  0 Discussions Create my own version
The continuous gain map takes a probability simplex to itself. The Brouwer fixed-point theorem supplies a fixed point, whose positive gains would contradict the zero strategy-weighted average payoff excess. Thus all gains vanish, giving a strategy that is a best response to itself. In a symmetric bimatrix game, this produces a symmetric equilibrium.

 Ancestors (8)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 38 / 5 / a / 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