OurBigBook About$ Donate
 Sign in Sign up

Support enumeration for a bimatrix game

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Game theory Bimatrix game
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Enumerate pairs of strategy supports, solve the equations making each supported action indifferent, then check strict positivity of supported probabilities and all omitted-action payoff inequalities. These conditions suffice for a Nash equilibrium. Under nondegeneracy of a bimatrix game, only pairs of equal support size need be tested.

 Ancestors (6)

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

 Incoming links (1)

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