Enumeration of Nash equilibria for two-player games
From MaRDI portal
Publication:847809
DOI10.1007/s00199-009-0449-xzbMath1182.91013MaRDI QIDQ847809
David Avis, Rahul Savani, Bernhard von Stengel, Gabriel D. Rosenberg
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
91A10: Noncooperative games
90C05: Linear programming
91A05: 2-person games
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Uses Software
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
