A procedure for finding Nash equilibria in bi-matrix games
From MaRDI portal
Publication:3354485
Recommendations
Cites work
- scientific article; zbMATH DE number 4135740 (Why is no real title available?)
- scientific article; zbMATH DE number 3571895 (Why is no real title available?)
- Equilibrium Points of Bimatrix Games
- Rationalizable Strategic Behavior
- Rationalizable Strategic Behavior and the Problem of Perfection
- Refinements of the Nash equilibrium concept
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
- Equilibrium tracing in strategic-form games
- A global Newton method to compute Nash equilibria.
- A generalization of the Nash equilibrium theorem on bimatrix games
- Constant rank two-player games are PPAD-hard
- An extension of quantal response equilibrium and determination of perfect equilibrium
- Computing Simply Stable Equilibria
- Implementing the modified LH algorithm
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- An algorithmic approach toward the tracing procedure for bi-matrix games
- On the computation of stable sets and strictly perfect equilibria.
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- scientific article; zbMATH DE number 3999714 (Why is no real title available?)
- 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
- Enumeration of Nash equilibria for two-player games
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Hard-to-Solve Bimatrix Games
- Computing perfect stationary equilibria in stochastic games
- Homotopy methods to compute equilibria in game theory
- Simple search methods for finding a Nash equilibrium
- 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
- 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)
- scientific article; zbMATH DE number 177091 (Why is no real title available?)
- scientific article; zbMATH DE number 3847256 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4135740 (Why is no real title available?)
- 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)
