Finding all Nash equilibria of a finite game using polynomial algebra

DOI10.1007/s00199-009-0447-zzbMath1185.91025arXivmath/0612462MaRDI QIDQ847806

Ruchira S. Datta

Publication date: 19 February 2010

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612462

zbMATH Keywords

Nash equilibrium; noncooperative game; polynomial equation; algebraic variety; normal form game

Mathematics Subject Classification ID

91A10: Noncooperative games

65H04: Numerical computation of roots of polynomial equations

Related Items

Multihomogeneous resultant formulae for systems with scaled support, Existence of perfect equilibria: a direct proof, Semidefinite programming for min-max problems and games, A parametric representation of totally mixed Nash equilibria

Uses Software

• PHCpack
• SINGULAR
• Gambit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
• Homotopy methods to compute equilibria in game theory
• Simple search methods for finding a Nash equilibrium
• The number of roots of a system of equations
• Newton polytopes and the Bezout theorem
• The maximal number of regular totally mixed Nash equilibria
• A new algorithm for discussing Gröbner bases with parameters.
• Solving polynomial equations. Foundations, algorithms, and applications
• Oddness of the number of equilibrium points: a new proof
• Solving parametric polynomial systems
• The expected number of real roots of a multihomogeneous system of polynomial equations
• The nonsingular matrix completion problem
• Algorithm 795
• A Polyhedral Method for Solving Sparse Polynomial Systems
• SINGULAR
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Universality of Nash Equilibria
• Algorithms in real algebraic geometry