New approach to counting Nash equilibria Conference Paper uri icon


  • Methods that lead to the fastest algorithm for real solving, finding the solutions to a system of polynomial equations, are presented. Finding the real solutions of a polynomial system is an important fundamental problem not only in computational algebraic geometry but also in economic modeling. Finding Nash equilibria in certain game-theoretic economic models leads directly to real-solving. Algorithms for solving a polynomial problem, which is related to counting certain Nash equilibria, are discussed. These algorithms are extended to count all affine roots in matrices.

name of conference

  • Proceedings of the IEEE/IAFE 1997 Computational Intelligence for Financial Engineering (CIFEr)

published proceedings

  • IEEE/IAFE Conference on Computational Intelligence for Financial Engineering, Proceedings (CIFEr)

author list (cited authors)

  • Rojas, J. M.

complete list of authors

  • Rojas, JM

publication date

  • January 1997