Enumeration of Nash equilibria for two-player games
From MaRDI portal
Publication:847809
DOI10.1007/S00199-009-0449-XzbMATH Open1182.91013OpenAlexW2125467036MaRDI QIDQ847809FDOQ847809
Authors: David Avis, Gabriel Rosenberg, Rahul Savani, Bernhard von Stengel 
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
Recommendations
- Equilibrium computation for two-player games in strategic and extensive form
- Simple search methods for finding a Nash equilibrium
- Enumeration of all extreme equilibria of bimatrix games
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- Efficient computation of equilibria for extensive two-person games
Linear programming (90C05) Noncooperative games (91A10) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Non-cooperative games
- Introduction to algorithms
- Title not available (Why is that?)
- New maximal numbers of equilibria in bimatrix games
- Title not available (Why is that?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Maximal nash subsets for bimatrix games
- On the Strategic Stability of Equilibria
- Title not available (Why is that?)
- Equilibrium Points of Bimatrix Games
- Enumeration of all extreme equilibria of bimatrix games
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Nash and correlated equilibria: Some complexity considerations
- Efficient computation of behavior strategies
- A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games
- Equilibrium Points of Bimatrix Games
- How good are convex hull algorithms?
- Title not available (Why is that?)
- On nash subsets of bimatrix games
- Strategic Characterization of the Index of an Equilibrium
- A procedure for finding Nash equilibria in bi-matrix games
- A revised simplex method with integer Q-matrices
Cited In (39)
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- A parametric representation of totally mixed Nash equilibria
- Algorithms for closed under rational behavior (CURB) sets
- Enumerating the Nash equilibria of rank 1-games
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices
- Equilibrium payoffs of finite games
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Computing Simply Stable Equilibria
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- On Random Symmetric Bimatrix Games
- Fast Algorithms for Rank-1 Bimatrix Games
- Title not available (Why is that?)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Functional dependence in strategic games
- Game Theory Explorer: software for the applied game theorist
- Rational generating functions and integer programming games
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Nash equilibrium in a stochastic model of two competing athletes
- Automatic verification of concurrent stochastic systems
- Nondominated Nash points: application of biobjective mixed integer programming
- On taxed matrix games and changes in the expected transfer
- Effects of Profit Taxes in Matrix Games
- Homotopy methods to compute equilibria in game theory
- A detail-free mediator
- 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
- Simple search methods for finding a Nash equilibrium
- Equilibrium computation for two-player games in strategic and extensive form
- Security games over lexicographic orders
- Nash equilibria set computing in finite extended games
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices
- Title not available (Why is that?)
- Automated equilibrium analysis of \(2\times 2\times 2\) games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Finding all Nash equilibria of a finite game using polynomial algebra
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Enumeration of all extreme equilibria of bimatrix games
- A note on bimatrix game maximal Selten subsets
- A normal form game model of search and pursuit
Uses Software
This page was built for publication: Enumeration of Nash equilibria for two-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847809)
