A procedure for finding Nash equilibria in bi-matrix games
From MaRDI portal
Publication:3354485
DOI10.1007/BF01415958zbMath0729.90093MaRDI QIDQ3354485
A. H. van Den Elzen, Adolphus J. J. Talman
Publication date: 1991
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Noncooperative games (91A10) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (16)
Homotopy methods to compute equilibria in game theory ⋮ Equilibrium tracing in strategic-form games ⋮ Enumeration of Nash equilibria for two-player games ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems ⋮ An extension of quantal response equilibrium and determination of perfect equilibrium ⋮ 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 ⋮ A differentiable homotopy method to compute perfect equilibria ⋮ Semidefinite programming for min-max problems and games ⋮ Computing Nash equilibria by iterated polymatrix approximation ⋮ A path-following procedure to find a proper equilibrium of finite games ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ An algorithmic approach toward the tracing procedure for bi-matrix games
Cites Work
This page was built for publication: A procedure for finding Nash equilibria in bi-matrix games
