Implementing the modified LH algorithm
In this lengthy paper the authors give an explicit method to use a modified Lemke-Howson algorithm for the computation of equilibria in bimatrix games. The algorithm works for non-degenerate games only (as usual for Lemke/Howson-like algorithms). The advantage of this algorithm in contrast with other already known solution methods lies in the fact that the algorithm works directly on the payoff matrices \(A\) and \(B\) of the game. The authors prove that the algorithm works and provides an APL- program doing the job. There is no complexity analysis included.
- Another note on bimatrix games
- Bimatrix Equilibrium Points and Mathematical Programming
- Bimatrix games—an addendum
- Computing Equilibria of N-Person Games
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 3728058 (Why is no real title available?)
- scientific article; zbMATH DE number 3571895 (Why is no real title available?)
- scientific article; zbMATH DE number 4118196 (Why is no real title available?)
- scientific article; zbMATH DE number 3358265 (Why is no real title available?)
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm
- On triangulations for computing fixed points
- The Linear Complementarity Problem
- The Simplex Method for Quadratic Programming
- A modification to the LINPACK downdating algorithm
- On the convergence of the Lemke-Howson algorithm for bi-matrix games
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
- Professor Peter Sudhölter (1957--2024)
- Modifications of REML algorithm for HGLMs
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
This page was built for publication: Implementing the modified LH algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177222)
