A procedure for finding Nash equilibria in bi-matrix games
DOI10.1007/BF01415958zbMATH Open0729.90093MaRDI QIDQ3354485FDOQ3354485
Authors: A. H. van Den Elzen, Dolf Talman 
Publication date: 1991
Published in: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)
Recommendations
Noncooperative games (91A10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
Cited In (42)
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
- The Hotelling bi-matrix game
- Unit vector games
- A path-following procedure to find a proper equilibrium of finite games
- A differentiable homotopy method to compute perfect equilibria
- Constant rank two-player games are PPAD-hard
- A global Newton method to compute Nash equilibria.
- Equilibrium tracing in strategic-form games
- A generalization of the Nash equilibrium theorem on bimatrix games
- An extension of quantal response equilibrium and determination of perfect equilibrium
- Computing Simply Stable Equilibria
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Implementing the modified LH algorithm
- On the computation of stable sets and strictly perfect equilibria.
- An algorithmic approach toward the tracing procedure for bi-matrix games
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Title not available (Why is that?)
- A nonlinear Jacobi method for finding Nash equilibrium of simultaneous games
- Customized proximal point algorithm for Nash equilibrium of two-player games
- On the convergence of the Lemke-Howson algorithm for bi-matrix games
- Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
- Adjustment processes for exchange economies and noncooperative games
- Hard-to-Solve Bimatrix Games
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Enumeration of Nash equilibria for two-player games
- Computing perfect stationary equilibria in stochastic games
- Homotopy methods to compute equilibria in game theory
- Un nuevo algoritmo para la resolucion de juegos bimatriciales
- 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
- Computing Nash equilibria by iterated polymatrix approximation
- An experimental study of a DC optimization algorithm for bimatrix games
- Nash equilibria set computing in finite extended games
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
- Efficient decomposition of bimatrix games (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite programming for min-max problems and games
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- Enumeration of all extreme equilibria of bimatrix games
- Title not available (Why is that?)
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
This page was built for publication: A procedure for finding Nash equilibria in bi-matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354485)
