I hope this question is not totally off topic. I need to figure out a verify-algorithm which works in NP to answer the following question: given a normal form game G, does it have at least two Nash equilibria?
I know that I can verify NE in a 2 player zero-sum game with LFP's. But I cannot imagine how to solve my mentioned problem.
Does anyone have any hints?