OurBigBook About$ Donate
 Sign in Sign up

Nondegeneracy of a bimatrix game

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Game theory Bimatrix game
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A bimatrix game is nondegenerate if every mixed strategy with k positive coordinates has at most k pure best responses for the other player. This condition prevents ties in the leaving-variable choice along the usual Lemke-Howson algorithm path and allows unique continuation once the dropped label has been selected.

 Ancestors (6)

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

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 37 / 4 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 38 / 6 / 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