Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Lemke–Howson algorithm
open-in-new
<p>The Lemke–Howson algorithm is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> that computes a <a href="/facts/Nash_equilibrium/l74xzIHd">Nash equilibrium</a> of a <a href="/facts/Bimatrix_game/J0jHIycQ">bimatrix game</a>, named after its inventors, <a href="/facts/Carlton_E._Lemke/us58aoPU">Carlton E. Lemke</a> and J. T. Howson. It is said to be "the best known among the combinatorial algorithms for finding a Nash equilibrium", although more recently the Porter-Nudelman-Shoham algorithm has outperformed on a number of benchmarks. </p>