The Lemke-Howson algorithm computes a Nash equilibrium of a two-player game given in matrix form. It was created by Carlton E. Lemke and J. T. Howson in 1964 and works by tracing a path across two geometric structures called best-response polytopes, one for each player, in search of a pair of vertices that are completely labeled, which corresponds to an equilibrium of the game. It is described as the best known combinatorial algorithm for finding a single Nash equilibrium, though newer methods have since offered competitive practical alternatives. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Connections
In Field
Source Wikipedia: Lemke-Howson algorithm
Sources
Wikipedia: Lemke-Howson algorithm
Lead section
The Lemke-Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.
In Group: Numerical Search and Equilibrium Methods, Introduction
The Lemke-Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E.
In Field: Algorithms and Complexity Theory, Lead sentence
Lemke-Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.