On the Number of Nash Equilibria in a Bimatrix Game

We show that if y is an odd integer between 1 and 2n - 1, there is an n × n bimatrix game with exactly y Nash equilibria (NE). We conjecture that this 2n - 1 is a tight upper for n < 3, and provide bounds on the number of NEs in m × n nondegenerate games when min(m,n) < 4.