Implementing the modified LH algorithm

DOI10.1016/0096-3003(91)90088-5zbMath0753.90075OpenAlexW2160727206MaRDI QIDQ1177222

I. Krohn, S. Moltzahn, Joachim Rosenmüller, Peter Sudhölter, H. M. Wallmeier

Publication date: 26 June 1992

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/2909721

zbMATH Keywords

bimatrix gamescomputation of equilibriamodified Lemke-Howson algorithm

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Simplex Method for Quadratic Programming
• On triangulations for computing fixed points
• Another note on bimatrix games
• Bimatrix games—an addendum
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• Computing Equilibria of N-Person Games
• On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
• The Linear Complementarity Problem
• On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm

This page was built for publication: Implementing the modified LH algorithm