A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games

DOI10.1007/s10479-005-2265-4zbMath1138.91310OpenAlexW3125586106MaRDI QIDQ816528

P. Jean-Jacques Herings, Ronald J. A. P. Peeters

Publication date: 9 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2265-4

Mathematics Subject Classification ID

Noncooperative games (91A10) Numerical computation of solutions to systems of equations (65H10) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15)

Related Items (9)

Homotopy methods to compute equilibria in game theory ⋮ Finding all Nash equilibria of a finite game using polynomial algebra ⋮ Existence of perfect equilibria: a direct proof ⋮ An arbitrary starting tracing procedure for computing subgame 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 ⋮ Semidefinite programming for min-max problems and games ⋮ Computing equilibria for markets with constant returns production technologies ⋮ A parametric representation of totally mixed Nash equilibria ⋮ Applications of Algebra for Some Game Theoretic Problems

Uses Software

• HOMPACK

Cites Work

• Computing all solutions to polynomial systems using homotopy continuation
• On equilibria in finite games
• Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
• The maximal generic number of pure Nash equilibria
• The maximal number of regular totally mixed Nash equilibria
• A globally and universally stable price adjustment process
• Oddness of the number of equilibrium points: a new proof
• A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
• Algorithm 652
• A Method for Computing All Solutions to Systems of Polynomials Equations
• Computation of all solutions to a system of polynomial equations
• Finding All Solutions to a System of Polynomial Equations
• A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• On the Number of Solutions to Polynomial Systems of Equations
• Determining All Solutions to Certain Systems of Nonlinear Equations
• Finding all solutions to polynomial systems and other systems of equations
• The Algebraic Geometry of Perfect and Sequential Equilibrium
• Finding all isolated solutions to polynomial systems using HOMPACK
• The Expected Number of Nash Equilibria of a Normal Form Game
• Computing Equilibria of N-Person Games
• On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
• Universality of Nash Equilibria
• A differentiable homotopy to compute Nash equilibria of \(n\)-person games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games