Finding all Nash equilibria of a finite game using polynomial algebra

DOI10.1007/s00199-009-0447-zzbMath1185.91025arXivmath/0612462OpenAlexW2102920598MaRDI 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 equilibriumnoncooperative gamepolynomial equationalgebraic varietynormal form game

Mathematics Subject Classification ID

Noncooperative games (91A10) Numerical computation of roots of polynomial equations (65H04)

Related Items (15)

Basic theoretical foundations and insights on bilevel models and their applications to power systems ⋮ Existence of perfect equilibria: a direct proof ⋮ Finding multiple Nash equilibria via machine learning-supported Gröbner bases ⋮ A solution to the global identification problem in DSGE models ⋮ Automated equilibrium analysis of \(2\times 2\times 2\) games ⋮ A finite characterization of perfect equilibria ⋮ A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form ⋮ Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ Multihomogeneous resultant formulae for systems with scaled support ⋮ Semidefinite programming for min-max problems and games ⋮ A parametric representation of totally mixed Nash equilibria ⋮ An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players ⋮ Applications of Algebra for Some Game Theoretic Problems ⋮ A competitive optimal stopping game ⋮ Game Theory Explorer: software for the applied game theorist

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

This page was built for publication: Finding all Nash equilibria of a finite game using polynomial algebra