Enumeration of Nash equilibria for two-player games

DOI10.1007/s00199-009-0449-xzbMath1182.91013OpenAlexW2125467036MaRDI QIDQ847809

Bernhard von Stengel, Gabriel D. Rosenberg, David Avis, Rahul Savani

Publication date: 19 February 2010

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

Full work available at URL: https://doi.org/10.1007/s00199-009-0449-x

zbMATH Keywords

linear programmingNash equilibriumcomplementaritybimatrix game

Mathematics Subject Classification ID

Noncooperative games (91A10) Linear programming (90C05) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (22)

Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Homotopy methods to compute equilibria in game theory ⋮ Automatic verification of concurrent stochastic systems ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ Automated equilibrium analysis of \(2\times 2\times 2\) games ⋮ A detail-free mediator ⋮ On taxed matrix games and changes in the expected transfer ⋮ 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 ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ An exact solution method for binary equilibrium problems with compensation and the power market uplift problem ⋮ A note on bimatrix game maximal Selten subsets ⋮ Equilibrium payoffs of finite games ⋮ Effects of Profit Taxes in Matrix Games ⋮ Nash equilibrium in a stochastic model of two competing athletes ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ Security games over lexicographic orders ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games ⋮ Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices ⋮ A normal form game model of search and pursuit ⋮ On Random Symmetric Bimatrix Games ⋮ Game Theory Explorer: software for the applied game theorist

Uses Software

• lrs
• Gambit
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
• Nash and correlated equilibria: Some complexity considerations
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• New maximal numbers of equilibria in bimatrix games
• How good are convex hull algorithms?
• Efficient computation of behavior strategies
• Non-cooperative games
• Enumeration of All Extreme Equilibria of Bimatrix Games
• A procedure for finding Nash equilibria in bi-matrix games
• A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES
• Maximal nash subsets for bimatrix games
• On nash subsets of bimatrix games
• On the Strategic Stability of Equilibria
• Equilibrium Points of Bimatrix Games
• Equilibrium Points of Bimatrix Games
• Strategic Characterization of the Index of an Equilibrium
• A revised simplex method with integer Q-matrices
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Enumeration of Nash equilibria for two-player games